✦ LIBER ✦

Embedding Finite Lattices into the Σ02Enumeration Degrees

✍ Scribed by Steffen Lempp and Andrea Sorbi

Book ID: 124978658
Publisher: Association for Symbolic Logic
Year: 2002
Tongue: English
Weight: 489 KB
Volume: 67
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2694996

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding Finite Lattices into the Ideal

Embedding Finite Lattices into the Ideals of Computably Enumerable Turing Degrees

✍ William C. Calhoun and Manuel Lerman 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 274 KB

Embedding Finite Lattices into Finite Bi

Embedding Finite Lattices into Finite Biatomic Lattices

✍ Kira Adaricheva; Friedrich Wehrung 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 150 KB

A necessary and sufficient condition for

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees

✍ M. Lerman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We present a necessary and su cient condition for the embeddability of a principally decomposable ÿnite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and su cient for a ÿni

On the embedding of distributive lattice

On the embedding of distributive lattices into recursive polynomial degrees

✍ Han Xiaofeng 📂 Article 📅 1987 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 288 KB

A necessary and sufficient condition for

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element

✍ Burkhard Englert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 196 KB

We present a necessary and su cient condition for the embeddability of a ÿnite principally decomposable lattice into the computably enumerable degrees preserving greatest element.

Not every finite lattice is embeddable i

Not every finite lattice is embeddable in the recursively enumerable degrees

✍ A.H Lachlan; R.I Soare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 469 KB

## A certain lattice with eight elements is shown to be not embeddable as a lattice in the recursively enumerable degrees. This refutes the well-known Embedding Conjecture which asserted that every finite lattice could be so embedded.