On homogeneity and definability in the first-order theory of the Turing degrees

DOI10.2307/2273376zbMath0521.03027MaRDI QIDQ3671144

Richard A. Shore

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/2273376

zbMATH Keywords

Turing degrees; homogeneity conjecture; elementary equivalent

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

A General Framework for Priority Arguments, THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Definability in the Recursively Enumerable Degrees, The Role of True Finiteness in the Admissible Recursively Enumerable Degrees, Degree Structures: Local and Global Investigations, The jump is definable in the structure of the degrees of unsolvability, Forcing and reductibilities. II. Forcing in fragments of analysis, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers, The arithmetic and Turing degrees are not elementarily equivalent, Definable degrees and automorphisms of 𝒟, The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility

Cites Work

• First-order theory of the degrees of recursive unsolvability
• Fixed points of jump preserving automorphisms of degrees
• Reducibility orderings: Theories, definability and automorphisms
• A degree-theoretic definition of the ramified analytical hierarchy
• The homogeneity conjecture
• Unnamed Item