Rigidity and biinterpretability in the hyperdegrees

zbMATH Open1152.03035MaRDI QIDQ3530404FDOQ3530404

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)

Cited In (4)

• Martin's axiom and embeddings of upper semi-lattices into the Turing degrees
• Cohesive avoidance and strong reductions
• Title not available (Why is that?)
• PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Recursion theory. Computational aspects of definability 👍 👎
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\) 👍 👎
• Title not available (Why is that?) 👍 👎

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)