THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
DOI10.1017/JSL.2021.10OpenAlexW3126809999MaRDI QIDQ5000272FDOQ5000272
Authors: Alberto Marcone, Manlio Valenti 
Publication date: 12 July 2021
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.04245
Computation over the reals, computable analysis (03D78) Generalized Ramsey theory (05C55) Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Subsystems of second order arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Borel sets and Ramsey's theorem
- Title not available (Why is that?)
- Weihrauch degrees, omniscience principles and weak computability
- Effective Borel measurability and reducibility of functions
- Closed choice and a uniform low basis theorem
- How incomputable is the separable Hahn-Banach theorem?
- Every analytic set is Ramsey
- Title not available (Why is that?)
- Hyperarithmetically Encodable Sets
- An effective proof that open sets are Ramsey
- Title not available (Why is that?)
- The degree structure of Weihrauch-reducibility
- On the Ramsey property for sets of reals
- On the algebraic structure of Weihrauch degrees
- On the topological aspects of the theory of represented spaces
- The Vitali Covering Theorem in the Weihrauch Lattice
- Embeddings between well-orderings: computability-theoretic reductions
- SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE
- Completion of choice
Cited In (2)
This page was built for publication: THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000272)
