Every finite lattice can be embedded in a finite partition lattice

From MaRDI portal
Publication:1139064

DOI10.1007/BF02482893zbMath0433.06009MaRDI QIDQ1139064

Pavel Pudlák, Jiři Tůma

Publication date: 1980

Published in: Algebra Universalis (Search for Journal in Brave)




Related Items (55)

Bjarni Jónsson's contributions in algebraA perspective on algebraic representations of latticesA geometric study of cores of idempotent stochastic matricesComparator circuits over finite bounded posetsLattice Embeddings in the Recursively Enumerable Truth Table DegreesOn the use of ordered sets in problems of comparison and consensus of classificationsOn Feit's examples of intervals in subgroup latticesBurnside orders, Burnside algebras and partition latticesOn lattice representations with DCC posetsThe best extending cover-preserving geometric lattices of semimodular latticesStirling posetsLattices of annihilators in commutative algebras over fields.Embedding lattices into the wtt-degrees below 0′Identities and quasiidentities in the lattice of overcommutative semigroup varieties.Acts over semigroupsGeneral lattice theory: 1979 problem updateThe Bruhat-Chevalley-Renner order on the set partitionsRecent results in partition (Ramsey) theory for finite latticesA Boolean algebra of characteristic subgroups of a finite group.Representing finite convex geometries by relatively convex setsThe lattice of flats of a boolean representable simplicial complexA cover-preserving embedding of semimodular lattices into geometric latticesFinite intervals in the lattice of topologiesVarieties of monoids with complex lattices of subvarietiesOn a connection between information and group latticesProblems related to type-\(A\) and type-\(B\) matrices of chromatic joinsAlgebraic Representation, Dualities and BeyondA juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).Strong polynomial-time reducibilityThe p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theoryVarieties of Commutative SemigroupsModular and lower-modular elements of lattices of semigroup varieties.Cover preserving embedding of modular lattices into partition latticesFinite convex geometries of circlesPartition semantics for relationsThe homomorphism lattice induced by a finite algebraInfinite substructure lattices of models of Peano ArithmeticUnnamed ItemLattices of semigroup varietiesTight embedding of modular lattices into partition lattices: progress and programCongruence relations on finitary modelsEmbedding lattices into derived lattices.Simple congruence lattices of finite graphsOn sublattice lattice varietiesUnnamed ItemIntervals in subgroup lattices of infinite groups\(\Lambda \)-ultrametric spaces and lattices of equivalence relationsVarieties with Cofinal Sets: Examples and AmalgamationLattice universality of locally finite 2-groupsLattice representations for computability theoryOn representing \(M_n\)'s by congruence lattices of finite algebrasRegraphs and congruence latticesA property of finite algebras having \(M_ n's\) as congruence latticesThe lattice of varieties of monoidsJoin-semidistributive lattices and convex geometries.



Cites Work




This page was built for publication: Every finite lattice can be embedded in a finite partition lattice