The density of infima in the recursively enumerable degrees

DOI10.1016/0168-0072(91)90044-MzbMath0732.03034MaRDI QIDQ809074

Theodore A. Slaman

Publication date: 1991

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

zbMATH Keywords

intervalinfimarecursively enumerable degrees

Mathematics Subject Classification ID

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

Related Items (17)

Decomposition and infima in the computably enumerable degrees ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Highness and bounding minimal pairs ⋮ The weak density of properly d-r. e. branching degree in the d-r. e. degrees ⋮ Generalized nonsplitting in the recursively enumerable degrees ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ 1996–97 Annual Meeting of the Association for Symbolic Logic ⋮ Infima in the d.r.e. degrees ⋮ Contiguity and distributivity in the enumerable Turing degrees ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ The distribution of the generic recursively enumerable degrees ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Undecidability and 1-types in intervals of the computably enumerable degrees

Cites Work

• The recursively enumerable degrees are dense
• Decomposition of Recursively Enumerable Degrees
• Recursively enumerable sets and degrees

This page was built for publication: The density of infima in the recursively enumerable degrees