Infima in the d.r.e. degrees

DOI10.1016/0168-0072(93)90238-9zbMath0784.03023MaRDI QIDQ685080

D. Kaddah

Publication date: 22 September 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90238-9

zbMATH Keywords

branching; Turing degree; infima; d.r.e. set; embedding of finite lattice \(S_ 8\)

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, The weak density of properly d-r. e. branching degree in the d-r. e. degrees, The existence of high nonbounding degrees in the difference hierarchy, Infima of d.r.e. degrees, There Are No Maximal d.c.e. wtt-degrees, Infima of d.r.e. Degrees

Cites Work

• Unnamed Item
• Weak density and cupping in the d-r.e. degrees
• The density of infima in the recursively enumerable degrees
• The density of the nonbranching degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• Interpolation and embedding in the recursively enumerable degrees
• A limit on relative genericity in the recursively enumerable sets
• The undecidability of the recursively enumerable degrees
• D.R.E. Degrees and the Nondiamond Theorem
• Branching Degrees above low Degrees
• Recursively enumerable sets and degrees
• Computational complexity, speedable and levelable sets
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Trial and error predicates and the solution to a problem of Mostowski
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
• Recursive Enumerability and the Jump Operator