Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$

DOI10.1090/S0002-9939-2013-11719-3zbMath1298.03102OpenAlexW1518643755MaRDI QIDQ2862196

Richard A. Shore

Publication date: 14 November 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2013-11719-3

zbMATH Keywords

first-order arithmeticTuring degreesdouble jump

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (3)

The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees ⋮ Another note on the join property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding and coding below a 1-generic degree
• Definability in the Turing degrees
• First-order theory of the degrees of recursive unsolvability
• Bounding non-GL₂ and R.E.A.
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Defining Jump Classes in the Degrees Below 0'
• Interpretability and Definability in the Recursively Enumerable Degrees
• The Theory of the Degrees below 0 ′
• Reducibility orderings: Theories, definability and automorphisms
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• Domination, forcing, array nonrecursiveness and relative recursive enumerability

This page was built for publication: Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$