Decidability of the “almost all” theory of degrees
From MaRDI portal
Publication:4773694
DOI10.2307/2272735zbMath0287.02029MaRDI QIDQ4773694
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
03B25: Decidability of theories and sets of sentences
03C80: Logic with extra quantifiers and operators
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
The importance of Π10 classes in effective randomness, On a conjecture of Dobrinen and Simpson concerning almost everywhere domination, The Halting Problem Relativized to Complements, Effectivizing Lusin’s Theorem, Continuous randomness via transformations of 2-random sequences, Random non-cupping revisited, Automorphism bases for degrees of unsolvability, Non-coding enumeration operators, Limitwise monotonic spectra and their generalizations, Jump inversions inside effectively closed sets and applications to randomness
Cites Work