1974
DOI: 10.1007/bf02485732
|View full text |Cite
|
Sign up to set email alerts
|

From a lattice to its ideal lattice

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

1989
1989
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(18 citation statements)
references
References 13 publications
0
18
0
Order By: Relevance
“…In the present context, L(Q(Pfin(co))) is a complete lattice; 1(F) satisfies Whitman's condition as shown by Baker and Hales [2], h: L(Q(Pfin(co))) -» S(Pfin(o))) is a bounded lattice epimorphism as just shown, and 1(F) is isomorphic to a sublattice of S(Pbn((o)) as shown above. It follows that 1(F) is isomorphic to a sublattice of L(Q(P&n(a)))) > and, consequently, 1(F) is isomorphic to a sublattice of L(K), as required.…”
Section: S(pu(o))mentioning
confidence: 74%
“…In the present context, L(Q(Pfin(co))) is a complete lattice; 1(F) satisfies Whitman's condition as shown by Baker and Hales [2], h: L(Q(Pfin(co))) -» S(Pfin(o))) is a bounded lattice epimorphism as just shown, and 1(F) is isomorphic to a sublattice of S(Pbn((o)) as shown above. It follows that 1(F) is isomorphic to a sublattice of L(Q(P&n(a)))) > and, consequently, 1(F) is isomorphic to a sublattice of L(K), as required.…”
Section: S(pu(o))mentioning
confidence: 74%
“…A consequence of [20] gives that if P is a semilattice that is the ∧-reduct of a finite distributive lattice, then P is projective in semilattices. We will also need the following slight extension of a result of Baker and Hales [1]. Proof.…”
Section: Theorem 25 [12] a Distributive Lattice Has No Doubly Reducmentioning
confidence: 99%
“…Proof. We follow [1]. Let X be the set of all finite subsets of K partially ordered by set inclusion.…”
Section: Theorem 25 [12] a Distributive Lattice Has No Doubly Reducmentioning
confidence: 99%
See 1 more Smart Citation
“…B. Nation [4] (iii) follows from (i) and (ii), since a one-to-one map / of a lattice L onto a lattice M is an isomorphism if and only if / and its inverse are order-preserving.…”
Section: Lemma 14 Letv Be Locally Finite Consider the Maps Viamentioning
confidence: 99%