2005
DOI: 10.1007/s00012-004-1843-7
|View full text |Cite
|
Sign up to set email alerts
|

Lattices of algebraic subsets

Abstract: This survey article tackles different aspects of lattices of algebraic subsets, with the emphasis on the following: the theory of quasivarieties, general lattice theory and the theory of closure spaces with the anti-exchange axiom.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 32 publications
0
7
0
Order By: Relevance
“…We show in this paper that every lower bounded lattice in the class of lattices of suborders is perfect (Corollary 5.2). In general, it remains unknown whether every lower bounded lattice is perfect (see Problem 2 in [2]). …”
Section: Problem 1 Is Every Reasonable Lattice Perfect?mentioning
confidence: 99%
See 2 more Smart Citations
“…We show in this paper that every lower bounded lattice in the class of lattices of suborders is perfect (Corollary 5.2). In general, it remains unknown whether every lower bounded lattice is perfect (see Problem 2 in [2]). …”
Section: Problem 1 Is Every Reasonable Lattice Perfect?mentioning
confidence: 99%
“…Notice that the relations between the elements mimic those of the corresponding elements of the semilattice from Lemma 5.8, case (2), in the sense that a k+1 ≤ a k ∨ b k+1 holds in O(P, ≤). Define the suborders X = k≥2 b k ∨ b ω , Y = k≥1 a 2k ∨ k≥1 b 2k , and Z = k≥0 a 2k+1 ∨ k≥1 b 2k+1 .…”
Section: Corollary 52 Every Lower Bounded Lattice Of Suborders Is Pmentioning
confidence: 99%
See 1 more Smart Citation
“…It is also true that if R is distributive and A is Scott continuous, then Sp(A, R) is dually Scott continuous (see, for example, Adaricheva [2] for the case of R = id).…”
Section: Theorem 7 a Scott Continuous Lattice L Is Pseudo-complementmentioning
confidence: 99%
“…Statement (1) is straightforward to verify. For (2), assume that {p, p , q} ⊆ Π, p = p , and p ∩ p ⊆ q. Let s ∈ S ω be the least member of p ∩ p and s ≺ σ be the subcover of s that lies off q.…”
Section: Lemma 19mentioning
confidence: 99%