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

DOI10.2307/2273376MaRDI QIDQ3671144zbMATH OpenOpenAlexFDO

Authors 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 degreeshomogeneity conjectureelementary equivalent

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A degree-theoretic definition of the ramified analytical hierarchy
• First-order theory of the degrees of recursive unsolvability
• Fixed points of jump preserving automorphisms of degrees
• Reducibility orderings: Theories, definability and automorphisms
• The homogeneity conjecture

Cited in

(14)

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

This page was built for publication: On homogeneity and definability in the first-order theory of the Turing degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671144)