Undecidability and initial segments of the (r.e.) tt-degrees

DOI10.2307/2274468zbMath0724.03029OpenAlexW2083442865MaRDI QIDQ5202181

Christine Ann Haught, Richard A. Shore

Publication date: 1990

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

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

zbMATH Keywords

undecidabilitytreesfinite partition latticefull approximation type constructionupper semilattice of r.e. tt-degrees

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Interpreting true arithmetic in the theory of the r.e. truth table degrees ⋮ Undecidable fragments of elementary theories ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
• Lattice-theoretic decision problems in universal algebra
• First-order theory of the degrees of recursive unsolvability
• The computable enumerations of families of general recursive functions
• Initial segments of one-one degrees
• Initial segments of the degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• The undecidability of the recursively enumerable degrees
• Strong reducibilities
• Reducibility orderings: Theories, definability and automorphisms
• Distributive Initial Segments of the Degrees of Unsolvability
• Initial Segments of Many-One Degrees

This page was built for publication: Undecidability and initial segments of the (r.e.) tt-degrees