The jump is definable in the structure of the degrees of unsolvability
From MaRDI portal
Publication:3491536
DOI10.1090/S0273-0979-1990-15923-3zbMath0709.03035MaRDI QIDQ3491536
Publication date: 1990
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Working below a high recursively enumerable degree, A General Framework for Priority Arguments, Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond, Splitting theorems in recursion theory, Nonbounding and Slaman triples, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, The Prospects for Mathematical Logic in the Twenty-First Century, A splitting theorem for $n-REA$ degrees, Degree Structures: Local and Global Investigations, DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP, Bounding minimal degrees by computably enumerable degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak density and cupping in the d-r.e. degrees
- Degrees of unsolvability: structure and theory
- Definability in the Turing degrees
- Complementing below recursively enumerable degrees
- A non-inversion theorem for the jump operator
- The d.r.e. degrees are not dense
- Classical recursion theory. The theory of functions and sets of natural numbers
- First-order theory of the degrees of recursive unsolvability
- Fixed points of jump preserving automorphisms of degrees
- On automorphisms of the degrees that preserve jumps
- Initial segments of the degrees of unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- Complementation in the Turing degrees
- A jump class of noncappable degrees
- Pseudo Jump Operators. I: The R. E. Case
- Degrees joining to 0′
- On homogeneity and definability in the first-order theory of the Turing degrees
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Defining Jump Classes in the Degrees Below 0'
- Definable degrees and automorphisms of 𝒟
- Reducibility orderings: Theories, definability and automorphisms
- A degree-theoretic definition of the ramified analytical hierarchy
- A recursively enumerable degree which will not split over all lesser ones
- Countable initial segments of the degrees of unsolvability
- Working below a high recursively enumerable degree
- The strong anticupping property for recursively enumerable degrees
- The strong homogeneity conjecture
- Recursively enumerable sets of positive integers and their decision problems
