Decidability of the “almost all” theory of degrees

DOI10.2307/2272735zbMath0287.02029OpenAlexW2115526138MaRDI QIDQ4773694

John Stillwell

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic with extra quantifiers and operators (03C80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (10)

Random non-cupping revisited ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Automorphism bases for degrees of unsolvability ⋮ Jump inversions inside effectively closed sets and applications to randomness ⋮ The Halting Problem Relativized to Complements ⋮ The importance of Π₁⁰ classes in effective randomness ⋮ On a conjecture of Dobrinen and Simpson concerning almost everywhere domination ⋮ Non-coding enumeration operators ⋮ Effectivizing Lusin’s Theorem ⋮ Limitwise monotonic spectra and their generalizations

Cites Work

• Unnamed Item
• The upper semi-lattice of degrees of recursive unsolvability
• Distributive Initial Segments of the Degrees of Unsolvability

This page was built for publication: Decidability of the “almost all” theory of degrees