Biinterpretability up to double jump in the degrees below 0'

DOI10.1090/S0002-9939-2013-11719-3MaRDI QIDQ2862196zbMATH OpenOpenAlexFDO

Authors 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

double jumpfirst-order arithmeticTuring degrees

Mathematics Subject Classification ID

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

Recommendations

• Interpretability and Definability in the Recursively Enumerable Degrees
• The ^0_2 Turing degrees: automorphisms and definability
• Definability in the Recursively Enumerable Degrees
• scientific article; zbMATH DE number 66485
• Rigidity and biinterpretability in the hyperdegrees

Cites work

• Bounding non-GL₂ and R.E.A.
• Definability in the Turing degrees
• Defining Jump Classes in the Degrees Below 0'
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Embedding and coding below a 1-generic degree
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• First-order theory of the degrees of recursive unsolvability
• scientific article; zbMATH DE number 5504384 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 66485 (Why is no real title available?)
• Interpretability and Definability in the Recursively Enumerable Degrees
• Reducibility orderings: Theories, definability and automorphisms
• The Theory of the Degrees below 0 ′

Cited in

(6)

• Rigidity and biinterpretability in the hyperdegrees
• The ^0_2 Turing degrees: automorphisms and definability
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Another note on the join property
• A fixed point for the jump operator on structures
• On \(\Sigma _ 1\) and \(\Pi _ 1\) sentences and degrees of interpretability

This page was built for publication: Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)

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