Two embedding theorems for lower bounded lattices
From MaRDI portal
Recommendations
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- On lattices embeddable into lattices of algebraic subsets
- The lattice of embedded subsets
- Embedding $ p$-elementary lattices
- On lattice embeddings of a lattice into its intervals
- Embedding theory of lattices and its application for $2$-integrable lattices
- On two imbedding theorems
- Two embedding theorems
- Two embedding theorems
- Embedding lattices in \(L^2([0,1], \mathbb Z)\)
Cites work
Cited in
(16)- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- On the prevariety of perfect lattices
- Open questions related to the problem of Birkhoff and Maltsev
- Embedding finite lattices into finite biatomic lattices
- Sublattices of lattices of order-convex sets. I: The main representation theorem
- Every lattice with 1 and 0 is embeddable in the lattice of topologies of some set by an embedding which preserves the 1 and 0
- Optimum basis of finite convex geometry
- On lower bounded lattices.
- Surmise relations between tests -- preliminary results of the mathematical modeling
- Lattices of regular closed subsets of closure spaces
- Join-semidistributive lattices and convex geometries.
- Reflections on lower bounded lattices
- On finite lattices which are embeddable in subsemigroup lattices
- Representing finite convex geometries by relatively convex sets
- On the representation of lattices by subsemigroup lattices of bands
- A lower bound for rank 2 lattice rules
This page was built for publication: Two embedding theorems for lower bounded lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272234)
