Lattice embeddings into the recursively enumerable degrees. II
From MaRDI portal
Publication:4205431
DOI10.2307/2274738zbMath0687.03022MaRDI QIDQ4205431
Ambos-Spies, Klaus, Manuel Lerman
Publication date: 1989
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274738
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Initial segments of the lattice of ideals of r.e. degrees, Generalized nonsplitting in the recursively enumerable degrees, A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element, Lattice nonembeddings and initial segments of the recursively enumerable degrees, Structural theory of degrees of unsolvability: advances and open problems, A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees, Splitting theorems in recursion theory, A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees, Lattice nonembeddings and intervals of the recursively enumerable degrees, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Turing computability: structural theory, Degree Structures: Local and Global Investigations, Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991, The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
Cites Work
