A note on tolerance lattices of algebras with restricted similarity type
A note on triangular schemes for weak congruences
Some geometrical methods, the so called Triangular Schemes and Principles, are introduced and investigated for weak congruences of algebras. They are analogues of the corresponding notions for congruences. Particular versions of Triangular Schemes are equivalent to weak congruence modularity and to weak congruence distributivity. For algebras in congruence permutable varieties, stronger properties—Triangular Principles—are equivalent to weak congruence modularity and distributivity.
A note on varieties with distributive subalgebra lattices
A polynomial characterization of affine spaces over GF(3)
A polynomial characterization of nondistributive modular lattices
A precedence theorem for semigroups.
A principal topology obtained from uninorms
We obtain a principal topology and some related results. We also give some hints of possible applications. Some mathematical systems are both lattice and topological space. We show that a topology defined on the any bounded lattice is definable in terms of uninorms. Also, we see that these topologies satisfy the condition of the principal topology. These topologies can not be metrizable except for the discrete metric case. We show an equivalence relation on the class of uninorms on a bounded lattice...
À propos des théories de Galois finies et infinies
A pseudo representation theorem for various categories of relations.
A regular a-semigroups inducing a certain lattice.
A remark on a paper of Taimanov
A remark on polynomial functions over finite monoids.
A remark on the ideal extension property
A remark on v*-algebras
A representation theorem for idempotent medial algebras
A scheme for congruence semidistributivity
A diagrammatic statement is developed for the generalized semidistributive law in case of single algebras assuming that their congruences are permutable. Without permutable congruences, a diagrammatic statement is developed for the ∧-semidistributive law.
A semantic construction of two-ary integers
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension. This...
A short proof of Rédei's Theorem.
A simple basis of ideal terms of Brouwerian semilattices
A simple geometric proof of a theorem on