Rigidity and biinterpretability in the hyperdegrees

MaRDI QIDQ3530404zbMATH OpenFDO

Authors Richard A. Shore

Publication date 20 October 2008

zbMATH Keywords

hyperarithmetic degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 66485
• scientific article; zbMATH DE number 5504384
• Recursion theory. Computational aspects of definability
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• scientific article; zbMATH DE number 1984267

Cited in

(5)

• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• scientific article; zbMATH DE number 66485 (Why is no real title available?)
• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• Cohesive avoidance and strong reductions
• Martin's axiom and embeddings of upper semi-lattices into the Turing degrees

This page was built for publication: Rigidity and biinterpretability in the hyperdegrees

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