A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees

DOI10.1016/S0168-0072(96)00031-0zbMath0883.03025MaRDI QIDQ1368585

Manuel Lerman, Steffen Lempp

Publication date: 23 March 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

decidabilitylattice embeddingscritical triplesposet of recursively enumerable degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (13)

Embedding finite lattices into the Σ₂⁰ enumeration degrees ⋮ 1998–1999 Winter Meeting of the Association for Symbolic Logic ⋮ Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees ⋮ Embedding finite lattices into the ideals of computably enumerable turing degrees ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees ⋮ A HIERARCHY OF 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 ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Degree Structures: Local and Global Investigations ⋮ The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees

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

This page was built for publication: A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees