DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP

DOI10.1142/S0219061307000676MaRDI QIDQ3521600zbMATH OpenOpenAlexFDO

Authors Richard A. Shore

Publication date 26 August 2008

Published in Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219061307000676

zbMATH Keywords

automorphismsdefinabilityhyperdegreesTuring degreesTuring jump

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Defining the Turing jump
• Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
• scientific article; zbMATH DE number 2204762
• scientific article; zbMATH DE number 5504384
• Jump embeddings in the Turing degrees
• A bounded jump for the bounded Turing degrees
• Splitting and jump inversion in the Turing degrees
• Turing and enumeration jumps in the Ershov hierarchy
• A Galois connection between Turing jumps and limits
• Local Initial Segments of The Turing Degrees

Cites work

• A degree-theoretic definition of the ramified analytical hierarchy
• A splitting theorem for n-REA degrees
• Definable degrees and automorphisms of 𝒟
• Defining the Turing jump
• Degree Structures: Local and Global Investigations
• First-order theory of the degrees of recursive unsolvability
• Fixed points of jump preserving automorphisms of degrees
• Initial segments of the degrees of unsolvability
• Interpretability and Definability in the Recursively Enumerable Degrees
• On a Conjecture of Kleene and Post
• On the representation of lattices
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• The jump is definable in the structure of the degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability

Cited in

(21)

• Defining the Turing jump
• A reducibility related to being hyperimmune-free
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• Low level nondefinability results: domination and recursive enumeration
• Properties of the jump classes
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• The Turing degrees below generics and randoms
• 2010 North American Annual Meeting of the Association for Symbolic Logic
• A 2-MINIMAL NON-GL₂ DEGREE
• Reverse mathematics: the playground of logic
• Uncountable master codes and the jump hierarchy
• 2-minimality, jump classes and a note on natural definability
• scientific article; zbMATH DE number 510777 (Why is no real title available?)
• scientific article; zbMATH DE number 2144532 (Why is no real title available?)
• Definability issues in the -Turing degrees
• Another note on the join property
• A fixed point for the jump operator on structures
• The jump of a Σ _n -cut
• scientific article; zbMATH DE number 2204762 (Why is no real title available?)
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond

This page was built for publication: DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP

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