Results 141 to 150 of about 1,225 (183)
On purely prime ideals in semilattices
Discussiones Mathematicae - General Algebra and ApplicationsNilesh Mundlik +2 more
doaj +1 more source
Rectangular groupoids and related structures.
Discrete Math, 2013 Boykett T.
europepmc +1 more source
Monotonic Distributive Semilattices [PDF]
Order, 2018 In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the variety of implicative meet-semilattices \cite{CelaniImplicative} \cite{ChajdaHalasKuhr}.
Sérgio A Celani, Celani Sérgio A
exaly +7 more sources
Infinite antichains in semilattices [PDF]
Order, 1985 In this paper we consider infinite antichains and the semilattices that they generate, mainly in the context of continuous semilattices. Conditions are first considered that lead to the antichain generating a copy of a countable product of the two ...
Michael Mislove +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Finite Distributive Semilattices
Applied Categorical Structures, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Testing for a Semilattice Term
Order, 2018A \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 +2 more
openaire +2 more sources
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
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
A contractionless semilattice semantics
Journal of Symbolic Logic, 1987Semilattice 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 +2 more
openaire +1 more source
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
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