6 citations · 11 across the 5 of their papers we have counts for
6 papers
Computably discrete represented spaces
Eike Neumann, Arno Pauly, Cécilia Pradic +1
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial s…
The equational theory of the Weihrauch lattice with (iterated) composition
Cécilia Pradic
We study the equational theory of the Weihrauch lattice with composition and iteration, meaning the collection of equations between terms built from variables, the lattice operatio…
The equational theory of the Weihrauch lattice with multiplication
Eike Neumann, Arno Pauly, Cécilia Pradic
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations …
On the Weihrauch degree of the additive Ramsey theorem
Arno Pauly, Cécilia Pradic, Giovanni Solda
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers.…
Cantor-Bernstein implies Excluded Middle
Cécilia Pradic, Chad E. Brown
We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven ass…
The logical strength of Büchi's decidability theorem
Leszek Kołodziejczyk, Henryk Michalewski, Cécilia Pradic +1
We study the strength of axioms needed to prove various results related to automata on infinite words and Büchi's theorem on the decidability of the MSO theory of . We…