Isolation and lattice embeddings

DOI10.2178/jsl/1190150148zbMath1023.03037MaRDI QIDQ4779650

Guohua Wu

Publication date: 12 November 2003

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

Full work available at URL: https://doi.org/10.2178/jsl/1190150148

zbMATH Keywords

lattice embedding; Turing degree; d.c.e degree; isolation pair

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D28: Other Turing degree structures

Related Items

2003 Annual Meeting of the Association for Symbolic Logic, Downward density of exact degrees, Almost universal cupping and diamond embeddings, Complementing cappable degrees in the difference hierarchy., Turing computability: structural theory, Isolation from side in 2-computably enumerable degrees, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, Bounding computably enumerable degrees in the Ershov hierarchy, There Are No Maximal d.c.e. wtt-degrees, Cupping and Diamond Embeddings: A Unifying Approach, The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees

Cites Work

• Weak density and cupping in the d-r.e. degrees
• The d.r.e. degrees are not dense
• Isolated d.r.e. degrees are dense in r.e. degree structure
• D.R.E. Degrees and the Nondiamond Theorem
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees