ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS

DOI10.1142/S0219061302000151zbMath1043.03034MaRDI QIDQ4799379

Peter A. Cholak, Leo Harrington

Publication date: 2002

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

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

zbMATH Keywords

definability; Turing reducibility; computably enumerable degrees; computably enumerable sets; jump classes

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, The Complexity of Orbits of Computably Enumerable Sets, Extension theorems, orbits, and automorphisms of the computably enumerable sets, Definable relations in Turing degree structures, Turing computability: structural theory, Computably enumerable sets that are automorphic to low sets, On the orbits of computably enumerable sets, Degree invariance in the Π₁⁰classes, Invariance in ℰ* and ℰ_{Π}

Cites Work

• d-simple sets, small sets, and degree classes
• Splitting properties and jump classes
• Coding in the partial order of enumerable sets
• Degrees of classes of RE sets
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of recursively enumerable sets which have no maximal supersets
• Recursion, metarecursion, and inclusion
• The Δ₃⁰-automorphism method and noninvariant classes of degrees