Hyperarithmetically Encodable Sets
From MaRDI portal
Publication:4198744
Cites work
- scientific article; zbMATH DE number 3427335 (Why is no real title available?)
- A model of set-theory in which every set of reals is Lebesgue measurable
- Borel sets and Ramsey's theorem
- Encodability of Kleene's O
- Representability in some systems of second order arithmetic
- Sets with no subset of higher degree
- The Theory of Countable Analytical Sets
- The fine structure of the constructible hierarchy
- The α-finite injury method
- Uniformly introreducible sets
Cited in
(24)- A reducibility related to being hyperimmune-free
- Canonical forms of shift-invariant maps on \([\mathbb N]^{\infty}\)
- The coding power of a product of partitions
- Computing sets from all infinite subsets
- Lawvere-Tierney topologies for computability theorists
- Ramsey-like theorems and moduli of computation
- Some Questions in Computable Mathematics
- Bases and Borel selectors for tall families
- A dual form of Ramsey's theorem
- A complexity problem for Borel graphs
- \({\Pi^1_2}\)-comprehension and the property of Ramsey
- The Galvin-Prikry theorem and set existence axioms
- Needed reals and recursion in generic reals
- Tall 𝐹_{𝜎} subideals of tall analytic ideals
- Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
- Iterated priority arguments in descriptive set theory
- Thin set theorems and cone avoidance
- Effective properties in compact sets of Borel functions
- THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
- Borel extractions of converging sequences in compact sets of Borel functions
- Ramsey's theorem for singletons and strong computable reducibility
- Genericity for Mathias forcing over general Turing ideals
- Dominating the Erdős-Moser theorem in reverse mathematics
- On needed reals
This page was built for publication: Hyperarithmetically Encodable Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198744)
