The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 141 –
160 of
2116
In [7] and [8], two sets of regular identities without finite proper models were introduced. In this paper we show that deleting one identity from any of these sets, we obtain a set of regular identities whose models include all affine spaces over GF(p) for prime numbers p ≥ 5. Moreover, we prove that this set characterizes affine spaces over GF(5) in the sense that each proper model of these regular identities has at least 13 ternary term functions and the number 13 is attained if and only if the...
In spite of increasing studies and investigations in the field of aggregation operators, there are two fundamental problems remaining unsolved: aggregation of -fuzzy set-theoretic notions and their justification. In order to solve these problems, we will formulate aggregation operators and their special types on partially ordered sets with universal bounds, and introduce their categories. Furthermore, we will show that there exists a strong connection between the category of aggregation operators...
A -labeled -poset is an (at most) countable set, labeled in the set , equipped with partial orders. The collection of all -labeled -posets is naturally equipped with binary product operations and -ary product operations. Moreover, the -ary product operations give rise to
A Σ-labeled n-poset is an (at most) countable set,
labeled in the set Σ, equipped with n partial orders.
The collection of all Σ-labeled n-posets is naturally
equipped with n binary product operations and
nω-ary product operations.
Moreover, the ω-ary product operations
give rise to nω-power operations.
We show that those Σ-labeled n-posets that can be generated from
the singletons by the binary and ω-ary
product operations form the free algebra on Σ
in a variety axiomatizable by an infinite collection...
Let be an infinite locally finite tree. We say that has exactly one end, if in any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considered and investigated with the aim of showing, whether they give algebras with the required properties. At...
The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with compact elements. We show that every algebraic lattice with at most compact elements is a complete sublattice of Cl(X).
Currently displaying 141 –
160 of
2116