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

DOI10.2307/2274468MaRDI QIDQ5202181zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 15488
• scientific article; zbMATH DE number 761273
• scientific article; zbMATH DE number 3954890
• scientific article; zbMATH DE number 535104
• The theory of the recursively enumerable weak truth-table degrees is undecidable

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Distributive Initial Segments of the Degrees of Unsolvability
• First-order theory of the degrees of recursive unsolvability
• Initial Segments of Many-One Degrees
• Initial segments of one-one degrees
• Initial segments of the degrees of unsolvability
• Lattice-theoretic decision problems in universal algebra
• On degrees of recursive unsolvability
• Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
• Reducibility orderings: Theories, definability and automorphisms
• Strong reducibilities
• The computable enumerations of families of general recursive functions
• The undecidability of the recursively enumerable degrees
• The upper semi-lattice of degrees of recursive unsolvability

Cited in

(9)

• scientific article; zbMATH DE number 15488 (Why is no real title available?)
• scientific article; zbMATH DE number 761273 (Why is no real title available?)
• Lattice initial segments of the hyperdegrees
• Minimal weak truth table degrees and computably enumerable Turing degrees
• scientific article; zbMATH DE number 3954890 (Why is no real title available?)
• Undecidable fragments of elementary theories
• Initial segments of Δ_2n+1¹-degrees
• Initial segments of the degrees of size \(\aleph _ 1\)
• Interpreting true arithmetic in the theory of the r.e. truth table degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202181)