Defining the Turing jump

DOI10.4310/MRL.1999.v6.n6.a10zbMath0958.03029WikidataQ55894375 ScholiaQ55894375MaRDI QIDQ1574741

Richard A. Shore, Theodore A. Slaman

Publication date: 13 August 2000

Published in: Mathematical Research Letters (Search for Journal in Brave)

zbMATH Keywords

Turing degree structures

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items

Reverse Mathematics: The Playground of Logic ⋮ AXIOM I₀ AND HIGHER DEGREE THEORY ⋮ The automorphism group of the enumeration degrees ⋮ 2-minimality, jump classes and a note on natural definability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES ⋮ DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP ⋮ The \(\omega\)-Turing degrees ⋮ The Prospects for Mathematical Logic in the Twenty-First Century ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees ⋮ A splitting theorem for $n-REA$ degrees ⋮ Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond ⋮ On Kalimullin pairs ⋮ Local Initial Segments of The Turing Degrees ⋮ Automorphisms of the truth-table degrees are fixed on a cone ⋮ DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ Mass problems associated with effectively closed sets ⋮ Turing degrees in Polish spaces and decomposability of Borel functions ⋮ Degree Structures: Local and Global Investigations ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ Effective randomness for continuous measures ⋮ Another note on the join property ⋮ Low Level Nondelegability Results: Domination and Recursive Enumeration ⋮ A reducibility related to being hyperimmune-free ⋮ Unprovability and proving unprovability