1970
DOI: 10.4153/cmb-1970-023-6
|View full text |Cite
|
Sign up to set email alerts
|

Injective Hulls of Semilattices

Abstract: 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. The symbol "∨" denotes least upper bounds under this partial ordering. If it is not clear from the context in which partially ordered set a least upper bound is taken, we add thi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

2
45
0

Year Published

1978
1978
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 75 publications
(47 citation statements)
references
References 0 publications
2
45
0
Order By: Relevance
“…In case the property lattice would be a complete Heyting algebra in which all joins encode disjunctions, then A and { A} again mean the same thing. As argued in Coecke (2001a), this redundancy is then exactly eliminated by considering distributive ideals DI(L) (Bruns and Lakser 1970), that is, order ideals, that are closed under joins of distributive sets (abbreviated as distributive joins), i.e. if A ⊆ I ∈ DI(L) then A ∈ I whenever we have ∀b ∈ L : b ∧ A = {b ∧ a | a ∈ A}.…”
Section: True Implicative Quantum Logicalitymentioning
confidence: 99%
See 3 more Smart Citations
“…In case the property lattice would be a complete Heyting algebra in which all joins encode disjunctions, then A and { A} again mean the same thing. As argued in Coecke (2001a), this redundancy is then exactly eliminated by considering distributive ideals DI(L) (Bruns and Lakser 1970), that is, order ideals, that are closed under joins of distributive sets (abbreviated as distributive joins), i.e. if A ⊆ I ∈ DI(L) then A ∈ I whenever we have ∀b ∈ L : b ∧ A = {b ∧ a | a ∈ A}.…”
Section: True Implicative Quantum Logicalitymentioning
confidence: 99%
“…state, possesses a quality a if it is the case that: whenever it (in realization p) is within environment e a then it causes phenomenon α a to happen" and it is by this statement that we identify a particular quality of the system 10 -this explicit consideration of the environment (or context), even in the system's endo-perspective, is what gives the operational flavour to this approach. 11 Before we continue let us first recall some basic order theoretical notions. A complete lattice is a bounded partially ordered set (L, ≤, 0, 1) which is such that every subset A ⊆ L has a greatest lower bound or meet A.…”
Section: What Quantum Logicality Can Be Aboutmentioning
confidence: 99%
See 2 more Smart Citations
“…Using the characterization [3], [18] of injective A-semilattices S as complete Brouwerian lattices and the fact that for any A E S, I0(A) is a complete join-continuous lattice (see [10, p. 152]), we quickly see that 7004) is an injective A-semilattice iff it is a distributive lattice. Therefore A is flat iff I0(A) is a distributive lattice.…”
mentioning
confidence: 99%