Compact universal relation in varieties with constants
Compactness and homomorphisms of algebraic structures
Compatible Idempotent Terms in Universal Algebra
In universal algebra, we oftentimes encounter varieties that are not especially well-behaved from any point of view, but are such that all their members have a “well-behaved core”, i.e. subalgebras or quotients with satisfactory properties. Of special interest is the case in which this “core” is a retract determined by an idempotent endomorphism that is uniformly term definable (through a unary term ) in every member of the given variety. Here, we try to give a unified account of this phenomenon....
Compatible relations on algebras
Compatible tolerances on groupoids
Complements of congruences in an -group
Complete generators and maximal completions of -algebras
Complete permutability of partitions in a set. I
Completely dissociative groupoids
In a groupoid, consider arbitrarily parenthesized expressions on the variables where each appears once and all variables appear in order of their indices. We call these expressions -ary formal products, and denote the set containing all of them by . If are distinct, the statement that and are equal for all values of is a generalized associative law. Among other results, we show that many small groupoids are completely dissociative, meaning that no generalized associative law holds...
Completely Regular and Orthodox Congruences on Regular Semigroups
Completely regular and orthodox congruences on regular semigroups.
Completeness criteria and invariants for operation and transformation algebras.
Completeness, functional completeness and relative completeness.
Completeness theorem for the Evans logic of identities.
Complétion et complétude selon H. Andreka et I. Nemeti
Completion varieties
Complexity of hypersubstitutions and lattices of varieties
Hypersubstitutions are mappings which map operation symbols to terms. The set of all hypersubstitutions of a given type forms a monoid with respect to the composition of operations. Together with a second binary operation, to be written as addition, the set of all hypersubstitutions of a given type forms a left-seminearring. Monoids and left-seminearrings of hypersubstitutions can be used to describe complete sublattices of the lattice of all varieties of algebras of a given type. The complexity...
Complexity of terms, composition, and hypersubstitution.
Composition of axial functions of products of finite sets
We show that every function f: A × B → A × B, where |A| ≤ 3 and |B| < ω, can be represented as a composition f₁ ∘ f₂ ∘ f₃ ∘ f₄ of four axial functions, where f₁ is a vertical function. We also prove that for every finite set A of cardinality at least 3, there exist a finite set B and a function f: A × B → A × B such that f ≠ f₁ ∘ f₂ ∘ f₃ ∘ f₄ for any axial functions f₁, f₂, f₃, f₄, whenever f₁ is a horizontal function.
Composition-representative subsets.