Embedding and coding below a 1-generic degree

DOI10.1305/NDJFL/1091122498MaRDI QIDQ558421zbMATH OpenOpenAlexFDO

Authors Noam Greenberg, Antonio Montalbán

Publication date 6 July 2005

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1091122498

zbMATH Keywords

lattice embeddingelementary theorygeneric degree

Mathematics Subject Classification ID

Other Turing degree structures (03D28) First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees
• A note on the enumeration degrees of 1-generic sets
• Minimal degrees recursive in 1-generic degrees
• The Turing degrees below generics and randoms
• Coding true arithmetic in the Medvedev and Muchnik degrees

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 4204326 (Why is no real title available?)
• scientific article; zbMATH DE number 3916242 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 3728252 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• A 1-generic degree which bounds a minimal degree
• A 1-generic degree with a strong minimal cover
• Definability in the Turing degrees
• Definability in the enumeration degrees
• Distributive Initial Segments of the Degrees of Unsolvability
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• First-order theory of the degrees of recursive unsolvability
• Interpretability and Definability in the Recursively Enumerable Degrees
• Lattices, equivalence relations, and subgroups
• Minimal degrees recursive in 1-generic degrees
• On the representation of lattices
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Reducibility orderings: Theories, definability and automorphisms
• Set theory. An introduction to independence proofs. 2nd print
• The Theory of the Degrees below 0 ′
• The degrees below a 1-generic degree < 0′
• The undecidability of the recursively enumerable degrees

Cited in

(5)

• The theory of the degrees is undecidable
• Coding true arithmetic in the Medvedev and Muchnik degrees
• The finite intersection principle and genericity
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• The Turing degrees below generics and randoms

This page was built for publication: Embedding and coding below a 1-generic degree

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