Results 141 to 150 of about 1,290 (174)

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

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 (Prof. Dr.)   +1 more
openaire   +2 more sources

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

n-median semilattices

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, Janowitz, Melvin F., Meletiou, Gerasimos C.   +2 more
openaire   +2 more sources

HNN EXTENSIONS OF SEMILATTICES

International Journal of Algebra and Computation, 1999
The 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, 2015
AbstractWe 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, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

DISTRIBUTIVE PSEUDOCOMPLEMENTED SEMILATTICES

Asian-European Journal of Mathematics, 2010
In this paper we will extend the topological duality given in [1] to the class of distributive pseudocomplemented semilattices and to the class of distributive Stone semilattices.
openaire   +1 more source

Pseudocomplemented and Implicative Semilattices

Canadian Journal of Mathematics, 1982
Let 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

Acts over semilattices

Journal of Mathematical Sciences, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source