Results 31 to 40 of about 10,642 (232)
Some remarks on certain classes of semilattices
In this paper the concept of a ∗-semilattice is introduced as a generalization to distributive ∗-lattice first introduced by Speed [1]. It is shown that almost all the results of Speed can be extended to a more eneral class of distributive ∗-semilattices.
P. V. Ramana Murty, M. Krishna Murty
doaj +1 more source
Determinants on Semilattices [PDF]
This corollary can be applied to the construction of some (? 1)determinants with large values. For the background on generalized M\4obius functions we refer to the paper [2 ] by Gian-Carlo Rota. 2. We first prove a lemma. LEMMA. Let X be a finite-semilattice and a, b CX such that b $ a.
openaire +2 more sources
Quasi-Semilattices on Networks
This paper introduces a representation of subnetworks of a network Γ consisting of a set of vertices and a set of relations, where relations are the primitive structures of a network. It is proven that all connected subnetworks of a network Γ form a quasi-semilattice L(Γ), namely a network quasi-semilattice.Two equivalences σ and δ are defined on L(Γ).
Yanhui Wang, Dazhi Meng
openaire +3 more sources
Distributive lattices have the intersection property [PDF]
Distributive lattices form an important, well-behaved class of lattices. They are instances of two larger classes of lattices: congruence-uniform and semidistributive lattices.
Henri Mühle
doaj +1 more source
Conservative constraint satisfaction re-revisited [PDF]
Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way.
Bulatov, Andrei A.
core +1 more source
Representation of right zero semigroups and their semilattices by a transformation semigroup
Background. As is known, an arbitrary semigroup can be represented by a semigroup of transformations that are right shifts either in this semigroup itself or in the extended semigroup obtained from the original one by adding an outer unit. The problems
L.V. Zyablitseva +2 more
doaj +1 more source
Monotonic Distributive Semilattices [PDF]
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}.
Sergio A. Celani, Ma. Paula Menchón
openaire +2 more sources
On Graphs of Bounded Semilattices [PDF]
totally revised! Comments are still welcomed!
Malakooti Rad, P., Nasehpour, P.
openaire +2 more sources
A metrizable Lawson semitopological semilattice with non-closed partial order
We construct a metrizable Lawson semitopological semilattice $X$ whose partial order $\le_X\,=\{(x,y)\in X\times X:xy=x\}$ is not closed in $X\times X$. This resolves a problem posed earlier by the authors.
Taras Banakh +2 more
doaj +1 more source
A semilattice of varieties of completely regular semigroups [PDF]
Completely regular semigroups are unions of their (maximal) subgroups with the unary operation within their maximal subgroups. As such they form a variety whose lattice of subvarieties is denoted by $\mathcal L(\mathcal C\mathcal R)$.
Mario Petrich
doaj +1 more source

