On the Σ2-theory of the upper semilattice of Turing degrees

DOI10.2307/2275332zbMath0848.03021OpenAlexW2111160831MaRDI 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

zbMATH Keywords

decidabilitydegrees of unsolvabilityleast degree\(\Sigma_ 2\)-theoryleast upper bound operatorupper semilattice of Turing degrees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES ⋮ 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

• The elementary theory of recursively enumerable sets

This page was built for publication: On the Σ₂-theory of the upper semilattice of Turing degrees