A Rigid Cone in the Truth-Table Degrees with Jump

DOI10.1007/978-3-319-50062-1_29zbMath1485.03153arXiv0901.3949OpenAlexW1687391554MaRDI QIDQ2970975

Bjørn Kjos-Hanssen

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (1)

PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES

Cites Work

• Unnamed Item
• Density of a final segment of the truth-table degrees
• A new proof of the congruence lattice representation theorem
• Fixed points of jump preserving automorphisms of degrees
• Definability in the Recursively Enumerable Degrees
• Automorphisms of the truth-table degrees are fixed on a cone
• On homogeneity and definability in the first-order theory of the Turing degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• The Theory of the Degrees below 0 ′
• Countable initial segments of the degrees of unsolvability
• Local Initial Segments of The Turing Degrees
• Continuous Lattices and Domains

This page was built for publication: A Rigid Cone in the Truth-Table Degrees with Jump