Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Maximal semilattice quotient (view)

searching for Semilattice 12 found (182 total)

alternate case: semilattice

Residuated lattice (1,865 words) [view diff] exact match in snippet view article find links to article

residuated Boolean algebras, relation algebras, and MV-algebras. Residuated semilattices omit the meet operation ∧, for example Kleene algebras and action algebras
Action algebra (1,165 words) [view diff] exact match in snippet view article find links to article
action algebra is an algebraic structure which is both a residuated semilattice and a Kleene algebra. It adds the star or reflexive transitive closure
Supersolvable arrangement (162 words) [view diff] exact match in snippet view article find links to article
flag consisting of modular elements. Equivalently, the intersection semilattice of the arrangement is a supersolvable lattice, in the sense of Richard
Scott domain (1,027 words) [view diff] exact match in snippet view article find links to article
Additionally, Scott domains appear with other names like "algebraic semilattice" in some publications. Originally, Dana Scott demanded a complete lattice
Aperiodic semigroup (285 words) [view diff] exact match in snippet view article find links to article
as divisors of iterated block products of copies of the two-element semilattice. Monogenic semigroup Special classes of semigroups Kilp, Mati; Knauer
Tree (set theory) (1,310 words) [view diff] exact match in snippet view article
single-rooted tree of height ≤ ω {\displaystyle \leq \omega } forms a meet-semilattice, where meet (common ancestor) is given by maximal element of intersection
Tree (set theory) (1,310 words) [view diff] exact match in snippet view article
single-rooted tree of height ≤ ω {\displaystyle \leq \omega } forms a meet-semilattice, where meet (common ancestor) is given by maximal element of intersection
Locally compact space (2,532 words) [view diff] exact match in snippet view article find links to article
Zbl 0522.54003 Bice, Tristan; Kubiś, Wiesław (2020). "Wallman Duality for Semilattice Subbases". arXiv:2002.05943 [math.GN]. Steen & Seebach, p. 20 Kelley
Limit-preserving function (order theory) (1,244 words) [view diff] exact match in snippet view article
poset in which every non-empty finite supremum exists (a so-called sup-semilattice) preserves arbitrary suprema if and only if it preserves both directed
E-dense semigroup (422 words) [view diff] exact match in snippet view article find links to article
1017/S1446788700035199. Manoj Siripitukdet and Supavinee Sattayaporn Semilattice Congruences on E-inversive Semigroups Archived 2014-09-03 at the Wayback
Christopher Alexander (4,338 words) [view diff] exact match in snippet view article find links to article
already had some primary ideas of complex networks, although he used semilattice rather than complex networks. In his 1964 book Notes on the Synthesis
Information algebra (2,296 words) [view diff] exact match in snippet view article find links to article
ψ {\displaystyle \psi } . The semigroup Φ {\displaystyle \Phi } is a semilattice relative to this order, i.e. ϕ ⊗ ψ = ϕ ∨ ψ {\displaystyle \phi \otimes