2018
DOI: 10.33044/revuma.v59n2a04
|View full text |Cite
|
Sign up to set email alerts
|

A topological duality for mildly distributive meet-semilattices

Abstract: We develop a topological duality for the category of mildly distributive meet-semilattices with a top element and certain morphisms between them. Then, we use this duality to characterize topologically the lattices of Frink ideals and filters, and we also obtain a topological representation for some congruences on mildly distributive meet-semilattices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…The following lemma is a useful characterization of irreducible filters [7]. Lemma Let A$A$ be a semilattice and F$F$ a proper filter of A$A$.…”
Section: A Dual Equivalence For the Algebraic Category Of Subresiduat...mentioning
confidence: 99%
See 2 more Smart Citations
“…The following lemma is a useful characterization of irreducible filters [7]. Lemma Let A$A$ be a semilattice and F$F$ a proper filter of A$A$.…”
Section: A Dual Equivalence For the Algebraic Category Of Subresiduat...mentioning
confidence: 99%
“…The following characterization is quite useful in practice (cf. [7]). Lemma Let A$A$ be a semilattice and F$F$ a proper filter of A$A$.…”
Section: A Dual Equivalence For the Algebraic Category Of Subresiduat...mentioning
confidence: 99%
See 1 more Smart Citation
“…5.2). Following a similar strategy, we shall use the duality for (implicative) meet semilattices developed in [7,8,13] by Celani and collaborators (Subsect. 5.3) as a basis for our dualities for weak implicative (Subsect.…”
Section: Dualitiesmentioning
confidence: 99%
“…Proposition 5.13 below). The following characterizations are quite useful in practice (see [7,8]). A filter F is irreducible iff for every a, b / ∈ F there exists f ∈ F and c / ∈ F such that a ∧ f ≤ c and b ∧ f ≤ c. A filter P is prime iff, for every a, b / ∈ F , there exists c / ∈ F such that a ≤ c and b ≤ c. An order ideal of S is a set I ⊆ S that is decreasing and such that for all a, b ∈ I, there exists c ∈ I with a, b ≤ c. It is easy to see that a filter F is irreducible iff F c = S − F is an order ideal.…”
Section: Meet Semilatticesmentioning
confidence: 99%