Undecidability and 1-types in intervals of the computably enumerable degrees

DOI10.1016/S0168-0072(99)00011-1zbMath0971.03040OpenAlexW1975543155WikidataQ126654546 ScholiaQ126654546MaRDI QIDQ1591201

Denis R. Hirschfeldt, Richard A. Shore, Ambos-Spies, Klaus

Publication date: 23 October 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(99)00011-1

zbMATH Keywords

undecidable theorytheories of Turing degrees

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Degrees containing members of thin Π10 classes are dense and co-dense

Cites Work

• Unnamed Item
• Unnamed Item
• Undecidability and 1-types in the recursively enumerable degrees
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• The density of infima in the recursively enumerable degrees
• The density of the nonbranching degrees
• The recursively enumerable degrees have infinitely many one-types
• The recursively enumerable degrees are dense
• On degrees of unsolvability
• The undecidability of the recursively enumerable degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: Undecidability and 1-types in intervals of the computably enumerable degrees