Results 21 to 30 of about 167 (147)
Gradual Sets: An Approach to Fuzzy Sets
In the fuzzy theory of sets and groups, the use of α‐levels is a standard to translate problems from the fuzzy to the crisp framework. Using strong α‐levels, it is possible to establish a one to one correspondence which makes possible doubly, a gradual and a functorial treatment of the fuzzy theory.
Josefa M. García +2 more
wiley +1 more source
Some Characterizations for Approximate Biflatness of Semigroup Algebras
In this paper, we study an approximate biflatness of l1(S), where S is a Clifford semigroup. Indeed, we show that a Clifford semigroup algebra l1(S) is approximately biflat if and only if every maximal subgroup of S is amenable, E(S) is locally finite, and l1(S) has an approximate identity in c00(S).
N. Razi, A. Sahami, Faranak Farshadifar
wiley +1 more source
Duality for powerset coalgebras [PDF]
Let CABA be the category of complete and atomic boolean algebras and complete boolean homomorphisms, and let CSL be the category of complete meet-semilattices and complete meet-homomorphisms. We show that the forgetful functor from CABA to CSL has a left
Guram Bezhanishvili +2 more
doaj +1 more source
Multi-argument specialization semilattices [PDF]
If $X$ is a closure space with closure $K$, we consider the semilattice $(\mathcal P(X), \cup)$ endowed with a further relation $ x \sqsubseteq\{ y_1, y_2, \dots, y_n\} $ between elements of $\mathcal P(X)$ and finite subsets of $\mathcal P(X)$, whose ...
Paolo Lipparini
doaj +1 more source
Semigroups Through Semilattices [PDF]
Presented in this paper is a method of constructing a compact semi- group 5 from a compact semilattice Xand a compact semigroup T having idempotents contained in X. The notions of semigroups (straight) through chains and (straight) through semilattices are introduced. It is shown that the notion of a semigroup through a chain is equivalent to that of a
Carruth, J. H., Lawson, J. D.
openaire +2 more sources
On general n-ary hyperstructure semilattices [PDF]
In this paper, the n-ary hyperstructure will be applied to some aspects of lattice theory. We introduce the concepts of general n-ary hyperstructure semilattice ( or gnh-semilattice) and Gnh-subsemilattice, ideal of gnh-semilattice, gno-order, Gnoorder ...
Akbar Dehghan Nezhad, Najmeh Khajuee
doaj +1 more source
On the Equational Base of SMB Algebras
The “semilattices of Mal’cev blocks”, for short SMB algebras, were defined by A. Bulatov. In a recently accepted paper by P. Đapić, P. Marković, R. McKenzie, and A.
Petar Đapić +2 more
doaj +1 more source
Monotone and cone preserving mappings on posets [PDF]
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to study in which posets some of these mappings coincide.
Ivan Chajda, Helmut Länger
doaj +1 more source
Polymorphism-homogeneity and universal algebraic geometry [PDF]
We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is polymorphism-homogeneous.
Endre Tóth, Tamás Waldhauser
doaj +1 more source
EXISTENTIALLY CLOSED BROUWERIAN SEMILATTICES [PDF]
AbstractThe variety of Brouwerian semilattices is amalgamable and locally finite; hence, by well-known results [19], it has a model completion (whose models are the existentially closed structures). In this article, we supply a finite and rather simple axiomatization of the model completion.
CARAI, LUCA, GHILARDI, SILVIO
openaire +4 more sources

