Results 131 to 140 of about 1,290 (174)
Some of the next articles are maybe not open access.
On semilattice relevant logics
Mathematical Logic Quarterly, 2003AbstractThe semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW (slightly different from the orthodox relevant logics R, T, RW, and TW) are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut‐free labelled sequent calculus with plural succedents (like LK).
exaly +2 more sources
Some semilattice decompositions of dimonoids [PDF]
Demonstratio Mathematica, 2011 We show that the system of axioms of a dimonoid is independent and prove that every dimonoid with a commutative operation is a semilattice of archimedean subdimonoids, every dimonoid with a commutative periodic semigroup is a semilattice of unipotent ...
Anatolii V Zhuchok
exaly +2 more sources
Canadian Mathematical Bulletin, 1980
AbstractSeveral characterizations for prime semilattices are obtained. Prime semilattices that are compactly packed by filters have been characterized. Solution to the problem, “Find a condition on a semilattice by which every filter can be expressed as the intersection of all prime filters containing it”, is furnished.
Pawar, Y. S., Thakare, N. K.
openaire +2 more sources
AbstractSeveral characterizations for prime semilattices are obtained. Prime semilattices that are compactly packed by filters have been characterized. Solution to the problem, “Find a condition on a semilattice by which every filter can be expressed as the intersection of all prime filters containing it”, is furnished.
Pawar, Y. S., Thakare, N. K.
openaire +2 more sources
Finite Distributive Semilattices
Applied Categorical Structures, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
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, 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
Journal of Mathematical Imaging and Vision, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source