A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
From MaRDI portal
Publication:1295397
DOI10.1016/S0168-0072(97)00071-7zbMath0924.03075MaRDI QIDQ1295397
Publication date: 8 November 1999
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items (5)
Embedding finite lattices into the ideals of computably enumerable turing degrees ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Cites Work
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- Not every finite lattice is embeddable in the recursively enumerable degrees
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- Lattice embeddings into the recursively enumerable degrees
- Recursively enumerable sets and degrees
- Lattice embeddings into the recursively enumerable degrees. II
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Algebraic aspects of the computably enumerable degrees.
- A minimal pair of recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- On Suborderings of Degrees of Recursive Unsolvability
- Unnamed Item
- Unnamed Item
This page was built for publication: A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
