Interpreting true arithmetic in the -enumeration degrees

DOI10.2178/JSL/1268917493zbMath1192.03019OpenAlexW1562786433MaRDI QIDQ3570161

Thomas F. Kent

Publication date: 24 June 2010

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

Full work available at URL: https://doi.org/10.2178/jsl/1268917493

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• The \(n\)-rea enumeration degrees are dense
• First-order theory of the degrees of recursive unsolvability
• Computably enumerable sets and quasi-reducibility
• Coding in the partial order of enumerable sets
• Definability in the enumeration degrees
• Density results in the \(\Delta_2^0\) e-degrees
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• Undecidable fragments of elementary theories
• On the degrees less than 0'
• ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
• Interpretability and Definability in the Recursively Enumerable Degrees
• Some Special Pairs of Σ2 e-Degrees
• Enumeration reducibility and partial degrees

This page was built for publication: Interpreting true arithmetic in the -enumeration degrees