On the Σ2-theory of the upper semilattice of Turing degrees
From MaRDI portal
Publication:5287687
DOI10.2307/2275332zbMath0848.03021MaRDI QIDQ5287687
Carl G. jun. Jockusch, Theodore A. Slaman
Publication date: 17 August 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275332
decidability; degrees of unsolvability; least degree; \(\Sigma_ 2\)-theory; least upper bound operator; upper semilattice of Turing degrees
03B25: Decidability of theories and sets of sentences
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable, Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices, Extensions of embeddings below computably enumerable degrees, Degree Structures: Local and Global Investigations
Cites Work