Complements of congruences in an -group
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.
Completion varieties
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.
Computability potential scales of -element algebras with restrictions on arity.
Computing the greatest -eigenvector of a matrix in max-min algebra
A vector is said to be an eigenvector of a square max-min matrix if . An eigenvector of is called the greatest -eigenvector of if and for each eigenvector . A max-min matrix is called strongly -robust if the orbit reaches the greatest -eigenvector with any starting vector of . We suggest an algorithm for computing the greatest -eigenvector of and study the strong -robustness. The necessary and sufficient conditions for strong -robustness are introduced and an efficient...
Concerning basic notions of the measurement theory
Concerning endomorphisms of finite algebra
Concerning functional equations of the generalized Bol-Moufang type.
Concerning minimal primitive classes of algebras containing any category of algebras as a full subcategory
Concrete representation of some equivalence lattices
Conditional distributivity of overlap functions over uninorms with continuous underlying operators
The investigations of conditional distributivity are encouraged by distributive logical connectives and their generalizations used in fuzzy set theory and were brought into focus by Klement in the closing session of Linzs 2000. This paper is mainly devoted to characterizing all pairs of aggregation functions that are satisfying conditional distributivity laws, where is an overlap function, and is a continuous t-conorm or a uninorm with continuous underlying operators.