Results 151 to 160 of about 1,225 (183)
Some of the next articles are maybe not open access.
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
Embeddability of the Semilattice L m 0 in Rogers Semilattices
Algebra and Logic, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Injective Hulls of Semilattices
Canadian Mathematical Bulletin, 1970A (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
Semilattices of Fault Semiautomata
1999We 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. +1 more
openaire +2 more sources
Order, 1991
The concept of a median semilattice is generalized in the following way: a meet semilattice \(S\) is called \(n\)-median semilattice iff all principal ideals in \(S\) are distributive lattices and any \(n\)-element subset of \(S\) has an upper bound whenever each of its \((n-1)\)-element subsets has an upper bound.
Bandelt, Hans-Jürgen +2 more
openaire +2 more sources
The concept of a median semilattice is generalized in the following way: a meet semilattice \(S\) is called \(n\)-median semilattice iff all principal ideals in \(S\) are distributive lattices and any \(n\)-element subset of \(S\) has an upper bound whenever each of its \((n-1)\)-element subsets has an upper bound.
Bandelt, Hans-Jürgen +2 more
openaire +2 more sources
HNN EXTENSIONS OF SEMILATTICES
International Journal of Algebra and Computation, 1999The main purpose of this paper is to investigate properties of an HNN extension of a semilattice, to give its equivalent characterizations and to discuss similarities with free groups. An HNN extension of a semilattice is shown to be a universal object in a certain category and an F-inverse cover over a free group for every inverse semigroup in the ...
openaire +2 more sources
SEMILATTICES AND THE RAMSEY PROPERTY
The Journal of Symbolic Logic, 2015AbstractWe consider${\cal S}$, the class of finite semilattices;${\cal T}$, the class of finite treeable semilattices; and${{\cal T}_m}$, the subclass of${\cal T}$which contains trees with branching bounded bym. We prove that${\cal E}{\cal S}$, the class of finite lattices with linear extensions, is a Ramsey class.
openaire +1 more source
On filters of implicative semilattices
Information Sciences, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Pseudocomplemented and Implicative Semilattices
Canadian Journal of Mathematics, 1982Let L be a semilattice and let a ∊ L. We refer the reader to Definitions 2.2, 2.4, 2.5 and 2.12 below for the terminology. If L is a-implicative, let Ca be the set of a-closed elements of L, and let Da be the filter of a-dense elements of L. Then Ca is a Boolean algebra. If a = 0, then C0 and D0 are the usual closed algebra and dense filter of L.
openaire +1 more source
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).
openaire +1 more source