The theory of the \(\alpha \) degrees is undecidable

DOI10.1007/s11856-010-0064-3zbMath1209.03033OpenAlexW2465496413MaRDI QIDQ607833

Theodore A. Slaman, Chi Tat Chong

Publication date: 6 December 2010

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-010-0064-3

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Embedding and coding below a 1-generic degree
• On degrees of recursive unsolvability
• Definability in the Turing degrees
• Negative solutions to Post's problem. II
• First-order theory of the degrees of recursive unsolvability
• Definability in the enumeration degrees
• Retraceable Sets
• Sentences true in all constructive models
• Noninitial segments of the α-degrees
• The role of true finiteness in the admissible recursively enumerable degrees
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• The fine structure of the constructible hierarchy
• The α-finite injury method
• On suborderings of the α-recursively enumerable α-degrees
• Unnamed Item
• Unnamed Item