How many four-generated simple lattices
Ivan Rival, Bill Sands (1982)
Banach Center Publications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Representation of complete lattices by sets”
How many four-generated simple lattices
On complemented strong lattices
Stern, Manfred (1989)
Portugaliae mathematica
Similarity:
The amalgamation property of varieties determined by primitive lattices
Václav Slavík (1980)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
On forbidden configuration of pseudomodular lattices
Manoj Dhake, Sachin Ballal, Vilas Kharat, Rupesh S. Shewale (2025)
Mathematica Bohemica
Similarity:
We characterize the pseudomodular lattices by means of a forbidden configuration.
Reflections and coreflections in generalized orthomodular lattices
Ladislav Beran (1975)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Stone Lattices
Adam Grabowski (2015)
Formalized Mathematics
Similarity:
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the...
Lattices of relative colour-families and antivarieties
Aleksandr Kravchenko (2007)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We consider general properties of lattices of relative colour-families and antivarieties. Several results generalise the corresponding assertions about colour-families of undirected loopless graphs, see [1]. Conditions are indicated under which relative colour-families form a lattice. We prove that such a lattice is distributive. In the class of lattices of antivarieties of relation structures of finite signature, we distinguish the most complicated (universal) objects. Meet decompositions...