The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 321 –
340 of
2116
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.
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...
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.
Brouwerian semilattices are meet-semilattices with 1 in which every element a has a relative pseudocomplement with respect to every element b, i. e. a greatest element c with a∧c ≤ b. Properties of classes of reflexive and compatible binary relations, especially of congruences of such algebras are described and an abstract characterization of congruence classes via ideals is obtained.
We say that a variety of algebras has the Compact Intersection Property (CIP), if the family of compact congruences of every is closed under intersection. We investigate the congruence lattices of algebras in locally finite, congruence-distributive CIP varieties and obtain a complete characterization for several types of such varieties. It turns out that our description only depends on subdirectly irreducible algebras in and embeddings between them. We believe that the strategy used here can...
Currently displaying 321 –
340 of
2116