Linear-compact congruence topologies in *-lattices
P. Rema (1965)
Fundamenta Mathematicae
Similarity:
P. Rema (1965)
Fundamenta Mathematicae
Similarity:
Batut, Christian, Quebbemann, Heinz-Georg, Scharlau, Rudolf (1995)
Experimental Mathematics
Similarity:
M. E. Adams (1974)
Colloquium Mathematicae
Similarity:
R. Beazer (1974)
Colloquium Mathematicae
Similarity:
Henri Mühle (2021)
Mathematica Bohemica
Similarity:
Distributive lattices form an important, well-behaved class of lattices. They are instances of two larger classes of lattices: congruence-uniform and semidistributive lattices. Congruence-uniform lattices allow for a remarkable second order of their elements: the core label order; semidistributive lattices naturally possess an associated flag simplicial complex: the canonical join complex. In this article we present a characterization of finite distributive lattices in terms of the core...
K. Auinger (1991)
Semigroup forum
Similarity:
Rudolf Scharlau (1994)
Mathematische Zeitschrift
Similarity:
Grätzer, G., Schmidt, E.T. (1995)
Beiträge zur Algebra und Geometrie
Similarity:
G. Szasz (1976)
Matematički Vesnik
Similarity:
Bachoc, Christine, Batut, Christian (1992)
Experimental Mathematics
Similarity:
R. Padmanabhan (1966)
Colloquium Mathematicae
Similarity:
Gábor Czédli (2022)
Archivum Mathematicum
Similarity:
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups,...