Automorphisms of the truth-table degrees are fixed on a cone

DOI10.2178/jsl/1243948334zbMath1165.03019arXiv0805.0005OpenAlexW2169472814MaRDI QIDQ3630586

Bernard A. Anderson

Publication date: 4 June 2009

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

Full work available at URL: https://arxiv.org/abs/0805.0005

zbMATH Keywords

automorphismtruth-table degrees

Mathematics Subject Classification ID

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

Related Items (4)

Bounded low and high sets ⋮ PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ A Rigid Cone in the Truth-Table Degrees with Jump ⋮ A bounded jump for the bounded Turing degrees

Cites Work

• Differences between resource bounded degree structures
• Density of a final segment of the truth-table degrees
• Classical recursion theory. Vol. II
• Defining the Turing jump
• Kolmogorov complexity and the Recursion Theorem
• Reducibility orderings: Theories, definability and automorphisms

This page was built for publication: Automorphisms of the truth-table degrees are fixed on a cone