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 property of stable theories
A property of the solvable radical in finitely decidable varieties
It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.
À propos des théories de Galois finies et infinies
A pseudo representation theorem for various categories of relations.
A reduction theorem for ring varieties whose subvariety lattice is distributive
We prove a theorem (for arbitrary ring varieties and, in a stronger form, for varieties of associative rings) which basically reduces the problem of a description of varieties with distributive subvariety lattice to the case of algebras over a finite prime field.
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 topological spaces, grids, and topological systems
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 semigroup in function algebra.
A short proof of Rédei's Theorem.