The density of infima in the recursively enumerable degrees
From MaRDI portal
Publication:809074
DOI10.1016/0168-0072(91)90044-MzbMath0732.03034MaRDI QIDQ809074
Publication date: 1991
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Highness and bounding minimal pairs, Generalized nonsplitting in the recursively enumerable degrees, 1996–97 Annual Meeting of the Association for Symbolic Logic, Contiguity and distributivity in the enumerable Turing degrees, 2000 Annual Meeting of the Association for Symbolic Logic, Infima in the d.r.e. degrees, Undecidability and 1-types in the recursively enumerable degrees, The distribution of the generic 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, Lattice nonembeddings and intervals of the recursively enumerable degrees, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, The weak density of properly d-r. e. branching degree in the d-r. e. degrees, Decomposition and infima in the computably enumerable degrees
Cites Work
