Definable degrees and automorphisms of 𝒟

DOI10.1090/S0273-0979-1981-14871-0zbMath0452.03033OpenAlexW2061250706MaRDI QIDQ3898485

Richard A. Shore, Leo Harrington

Publication date: 1981

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1981-14871-0

zbMATH Keywords

automorphismdefinability of Turing degreesdefinable degreesjump ideal

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (6)

The jump is definable in the structure of the degrees of unsolvability ⋮ DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP ⋮ Automorphism bases for degrees of unsolvability ⋮ Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond ⋮ Degree Structures: Local and Global Investigations ⋮ Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Cites Work

• Unnamed Item
• First-order theory of the degrees of recursive unsolvability
• On the degrees less than 0'
• The upper semi-lattice of degrees of recursive unsolvability
• On homogeneity and definability in the first-order theory of the Turing degrees
• Reducibility orderings: Theories, definability and automorphisms
• A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers
• The homogeneity conjecture
• Distributive Initial Segments of the Degrees of Unsolvability
• Minimal Covers and Arithmetical Sets
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Definable degrees and automorphisms of 𝒟