A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
From MaRDI portal
Publication:1368585
DOI10.1016/S0168-0072(96)00031-0zbMath0883.03025MaRDI QIDQ1368585
Publication date: 23 March 1998
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03D25: Recursively (computably) enumerable sets and degrees
Related Items
1998–1999 Winter Meeting of the Association for Symbolic Logic, Embedding finite lattices into the ideals of computably enumerable turing degrees, Embedding finite lattices into the Σ20 enumeration degrees, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element, A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable 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, Hierarchy of Computably Enumerable Degrees II, Degree Structures: Local and Global Investigations, TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES, The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Lattice embeddings into the recursively enumerable degrees
- Lattice embeddings into the recursively enumerable degrees. II
- A minimal pair of recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Sublattices of the Recursively Enumerable Degrees
