Results 171 to 180 of about 10,642 (232)

Finite Distributive Semilattices

Applied Categorical Structures, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fuzzy semilattices

Information Sciences, 1987
Properties of fuzzy ideals were considered by \textit{Y. Zhang} [BUSEFAL 27, 43-51 (1986; Zbl 0602.13002)]. Here the lattice of all fuzzy ideals of a given semilattice is considered. It has properties similar to the lattice of crisp ideals [cf. \textit{G. Grätzer}, Universal algebra (1968; Zbl 0182.342)].
openaire   +1 more source

Testing for a Semilattice Term

Order, 2018
A \textit{semilattice term} in an algebra \(A\) means a binary term which is commutative, associative and idempotent. A binary term \(b(x,y)\) is called a \textit{flat semilattice term} if \(A\) has an absorbing element \(0\) such that \(b(a,a)=a\) for every element a and \(b(a,b)=0\) for different elements \(a, b\).
Ralph Freese, James B. Nation, Matt Valeriote   +2 more
openaire   +2 more sources

SEMILATTICES OF SUBDIMONOIDS

Asian-European Journal of Mathematics, 2011
We present some congruence on the dimonoid with an idempotent operation and use it to obtain semilattice decompositions of an idempotent dimonoid. Also we give necessary and sufficient conditions under which an arbitrary dimonoid is a semilattice of archimedean subdimonoids.
openaire   +1 more source

Shape-Tree Semilattices

Journal of Mathematical Imaging and Vision, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A contractionless semilattice semantics

Journal of Symbolic Logic, 1987
Semilattice semantics for relevant logics were discovered independently by Routley and Urquhart over 10 years ago. A semilattice semantics was first published in [10], where the weak theory of implication of [8] and [3] (i.e., R →, the pure implication fragment of the system R of relevant implication) is shown to be consistent and complete with respect
Steve Giambrone, Robert K. Meyer, Alasdair Urquhart   +2 more
openaire   +1 more source

Semilattices of Fault Semiautomata

1999
We study defects affecting state transitions in sequential circuits. The fault-free circuit is modeled by a semiautomaton M, and ‘simple’ defects, called single faults, by a set S = {M 1, …,M k} of ‘faulty’ semiautomata. To define multiple faults from S, we need a binary composition operation, say ⊙, on semiautomata, which is idempotent, commutative ...
Brzozowski, J. A., Jürgensen, Helmut
openaire   +2 more sources

Injective Hulls of Semilattices

Canadian Mathematical Bulletin, 1970
A (meet-) semilattice is an algebra with one binary operation ∧, which is associative, commutative and idempotent. Throughout this paper we are working in the category of semilattices. All categorical or general algebraic notions are to be understood in this category. In every semilattice S the relationdefines a partial ordering of S.
Bruns, G., Lakser, H.
openaire   +2 more sources

On Rogers Semilattices

2006
Rogers semilattices of computable numberings for the families in the hierarchy of Ershov are compared with those for the families in the arithmetical hierarchy.
openaire   +1 more source

Reflexive Topological Semilattices

Canadian Mathematical Bulletin, 1981
The duality between compact 0-dimensional semilattices and discrete semilattices studied by K. H. Hofmann et al. [2] is here extended to larger categories of topological semilattices.We regard topological semilattices as objects in the category CvSl of convergence semilattices, believing CvSl to be the appropriate setting for this study.
Hong, S. S., Nel, L. D.
openaire   +2 more sources