✦ LIBER ✦

Lattices That are Embeddable in Suborder Lattices

✍ Scribed by M. V. Semenova

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 263 KB
Volume: 44
Category: Article
ISSN: 0002-5232
DOI: 10.1007/s10469-005-0027-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattices embeddable in subsemigroup latt

Lattices embeddable in subsemigroup lattices. I. Semilattices

✍ M. V. Semenova 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 188 KB

Lattices embeddable in subsemigroup latt

Lattices embeddable in subsemigroup lattices. II. Cancellative semigroups

✍ M. V. Semenova 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 159 KB

On geometries that are connected with ge

On geometries that are connected with general geometric lattices

✍ S. G. Kemkhadze; V. Sesadze 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 99 KB

Lattices contained in planar orders are

Lattices contained in planar orders are planar

✍ Richard Nowakowski; Ivan Rival; Jorge Urrutia 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 421 KB

On partially ordered sets embeddable in

On partially ordered sets embeddable in a free lattice

✍ J. B. Nation 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 313 KB

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.