### On the one class of hyperbolic systems.

Adler, Vsevolod E., Shabat, Alexey B. (2006)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Adler, Vsevolod E., Shabat, Alexey B. (2006)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

Miroslav Ploščica (2000)

Colloquium Mathematicae

Similarity:

We investigate the congruence lattices of lattices in the varieties ${\mathcal{M}}_{n}$. Our approach is to represent congruences by open sets of suitable topological spaces. We introduce some special separation properties and show that for different n the lattices in ${\mathcal{M}}_{n}$ have different congruence lattices.

G. Grätzer, A. Kisielewicz, B. Wolk (1992)

Colloquium Mathematicae

Similarity:

Koubek, V., Sichler, J. (2005)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Václav Koubek, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A concrete category $\mathbb{K}$ is (algebraically) if any category of algebras has a full embedding into $\mathbb{K}$, and $\mathbb{K}$ is if there is a class $\mathcal{C}$ of $\mathbb{K}$-objects such that all non-constant homomorphisms between them form a universal category. The main result of this paper fully characterizes the finitely generated varieties of $0$-lattices which are almost universal.

Richard N. Ball, Aleš Pultr, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting $n$-crowns with $n\ge 3$ does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.