A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
From MaRDI portal
Publication:5945396
DOI10.1016/S0168-0072(01)00091-4zbMath0986.03036MaRDI QIDQ5945396
Publication date: 6 June 2002
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Not every finite lattice is embeddable in the recursively enumerable degrees
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably 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
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
- On the degrees less than 0'
- The undecidability of the recursively enumerable degrees
- Lattice embeddings into the recursively enumerable degrees
- Decomposition of Recursively Enumerable Degrees
- Lattice embeddings into the recursively enumerable degrees. II
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- Algebraic aspects of the computably enumerable degrees.
- A minimal pair of recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Sublattices of the Recursively Enumerable Degrees
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
