On homogeneity and definability in the first-order theory of the Turing degrees
From MaRDI portal
Publication:3671144
DOI10.2307/2273376zbMATH Open0521.03027OpenAlexW1981509588MaRDI QIDQ3671144FDOQ3671144
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
Cites Work
- Title not available (Why is that?)
- First-order theory of the degrees of recursive unsolvability
- Reducibility orderings: Theories, definability and automorphisms
- A degree-theoretic definition of the ramified analytical hierarchy
- Fixed points of jump preserving automorphisms of degrees
- The homogeneity conjecture
Cited In (14)
- Forcing and reductibilities. II. Forcing in fragments of analysis
- Definable degrees and automorphisms of 𝒟
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
- A Rigid Cone in the Truth-Table Degrees with Jump
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- Degree Structures: Local and Global Investigations
- The arithmetic and Turing degrees are not elementarily equivalent
- Bad oracles in higher computability and randomness
- A General Framework for Priority Arguments
- Definability in the Recursively Enumerable Degrees
- The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
- The jump is definable in the structure of the degrees of unsolvability
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)
