scientific article; zbMATH DE number 2243109

From MaRDI portal
Publication:5715576

zbMath1106.06001MaRDI QIDQ5715576

George Grätzer

Publication date: 4 January 2006


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (max. 100)

The ordered set of principal congruences of a countable lattice.Notes on planar semimodular lattices. VI: On the structure theorem of planar semimodular latticesMy collaboration with E. T. Schmidt spanning six decadesCongruences of fork extensions of slim, planar, semimodular latticesA convex combinatorial property of compact sets in the plane and its roots in lattice theorySome preliminary results on the set of principal congruences of a finite latticeTwo notes on the variety generated by planar modular latticesThe order of principal congruences of a bounded latticeOn essential elements in a lattice and Goldie analogue theoremPositive universal classes in locally finite varietiesHomomorphisms and principal congruences of bounded lattices. II. Sketching the proof for sublatticesCongruences in slim, planar, semimodular lattices: The Swing LemmaRepresenting homomorphisms of distributive lattices as restrictions of congruences of rectangular latticesA cover-preserving embedding of semimodular lattices into geometric latticesPatch extensions and trajectory colorings of slim rectangular lattices.A new property of congruence lattices of slim, planar, semimodular latticesRepresenting some families of monotone maps by principal lattice congruencesCometic functors and representing order-preserving maps by principal lattice congruencesRepresenting a monotone map by principal lattice congruencesRelational understanding and paths of reasoning through a Boolean lattice classification of quadrilateralsA new look at the Jordan-Hölder theorem for semimodular latticesFinite distributive lattices are congruence lattices of almost-geometric latticesThe spectrum of a finite pseudocomplemented modular latticeA Nice labelling for tree-like event structures of degree 3Lattice classification by cut-through coding.A technical lemma for congruences of finite latticesFoundations of near setsThe spectrum of a finite pseudocomplemented latticeSums of lattices and a relational categorySome Observations on Oligarchies, Internal Direct Sums, and Lattice Congruences




This page was built for publication: