A Rigid Cone in the Truth-Table Degrees with Jump

DOI10.1007/978-3-319-50062-1_29zbMATH Open1485.03153arXiv0901.3949OpenAlexW1687391554MaRDI QIDQ2970975FDOQ2970975

Authors: Bjørn Kjos-Hanssen 

Publication date: 4 April 2017

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

Abstract: The automorphism group of the truth-table degrees with order and jump is fixed on the set of degrees above the fourth jump of 0.

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)

Cites Work

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

Cited In (1)

• Permutations of the integers induce only the trivial automorphism of the Turing degrees

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

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