Two Embedding Theorems for Finite Lattices

DOI10.2307/2033352zbMath0074.36002OpenAlexW4252120284MaRDI QIDQ3239703

Juris Hartmanis

Publication date: 1956

Full work available at URL: https://doi.org/10.2307/2033352

zbMATH Keywords

FoundationsNon-Euclidean Geometry

Related Items (5)

Line-closed combinatorial geometries ⋮ Every finite lattice can be embedded in a finite partition lattice ⋮ Finite Four-Generated Simple Lattices Contain All Finite Lattices ⋮ A Note on the Lattice of Geometries ⋮ Über endliche, ordnungspolynomvollständige Verbände

This page was built for publication: Two Embedding Theorems for Finite Lattices