Hyperarithmetically Encodable Sets

DOI10.2307/1997849zbMATH Open0411.03039OpenAlexW4251824600MaRDI QIDQ4198744FDOQ4198744

Robert M. Solovay

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/1997849

zbMATH Keywords

Turing reducibilitydescriptive set theoryintroreducibilityretraceable setrecursively encodablerelative hyperarithmeticity

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Title not available (Why is that?)
• A model of set-theory in which every set of reals is Lebesgue measurable
• The fine structure of the constructible hierarchy
• Borel sets and Ramsey's theorem
• The α-finite injury method
• Uniformly introreducible sets
• Sets with no subset of higher degree
• The Theory of Countable Analytical Sets
• Representability in some systems of second order arithmetic
• Encodability of Kleene's O

Cited In (24)

• Computing sets from all infinite subsets
• Needed reals and recursion in generic reals
• Borel extractions of converging sequences in compact sets of Borel functions
• BASES AND BOREL SELECTORS FOR TALL FAMILIES
• Lawvere-Tierney topologies for computability theorists
• Some Questions in Computable Mathematics
• The Galvin-Prikry theorem and set existence axioms
• RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
• On needed reals
• Effective properties in compact sets of Borel functions
• A reducibility related to being hyperimmune-free
• Thin set theorems and cone avoidance
• THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
• A dual form of Ramsey's theorem
• Dominating the Erdős-Moser theorem in reverse mathematics
• Ramsey’s theorem for singletons and strong computable reducibility
• \({\Pi^1_2}\)-comprehension and the property of Ramsey
• Fraïssé’s conjecture in Π11-comprehension
• The coding power of a product of partitions
• Iterated priority arguments in descriptive set theory
• Canonical forms of shift-invariant maps on \([\mathbb N]^{\infty}\)
• Genericity for Mathias forcing over general Turing ideals
• Tall 𝐹_{𝜎} subideals of tall analytic ideals
• A complexity problem for Borel graphs

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)