Pointwise and global sums and negatives of binary relations.
Pointwise and global sums and negatives of translation relations.
Polyabelian loops and Boolean completeness
We consider the question of which loops are capable of expressing arbitrary Boolean functions through expressions of constants and variables. We call this property Boolean completeness. It is a generalization of functional completeness, and is intimately connected to the computational complexity of various questions about expressions, circuits, and equations defined over the loop. We say that a loop is polyabelian if it is an iterated affine quasidirect product of Abelian groups; polyabelianness...
Polynome und algebraische Gleichungen über universalen Algebren.
Polynomial and Term Functions over Groups with Coprime Chief Factors.
Polynomial functions over finite monoids.
Polynomial functions over monoids.
Polynomial Interpolation and the Chinese Remainder Theorem for Algebraic Systems.
Polynomially determined congruences in algebras without constants
Polynomially determined tolerances
Polynomials in idempotent commutative groupoids [Book]
Polynomials in topological algebras
Polynomials over the permutation group of three elements
Polythéorie de Galois abstraite dans le cas infini général
Poset valued varieties.
Positive eigenvalues and two-letter generalized words.
Präprimale Algebren, die arithmetische Varietäten erzeugen
Preorders and equivalences generated by commuting relations.
Presolid varieties of n-semigroups
he class of all M-solid varieties of a given type t forms a complete sublattice of the lattice ℒ(τ) of all varieties of algebrasof type t. This gives a tool for a better description of the lattice ℒ(τ) by characterization of complete sublattices. In particular, this was done for varieties of semigroups by L. Polák ([10]) as well as by Denecke and Koppitz ([4], [5]). Denecke and Hounnon characterized M-solid varieties of semirings ([3]) and M-solid varieties of groups were characterized by Koppitz...
Prime Ideal Theorems and systems of finite character
We study several choice principles for systems of finite character and prove their equivalence to the Prime Ideal Theorem in ZF set theory without Axiom of Choice, among them the Intersection Lemma (stating that if is a system of finite character then so is the system of all collections of finite subsets of meeting a common member of ), the Finite Cutset Lemma (a finitary version of the Teichm“uller-Tukey Lemma), and various compactness theorems. Several implications between these statements...