The poset of closure systems on an infinite poset: detachability and semimodularity (Q616624): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On closure operators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattices and ordered algebraic structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Join congruence relations and closure relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2741274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530231 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS / rank | |||
Normal rank |
Latest revision as of 14:52, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The poset of closure systems on an infinite poset: detachability and semimodularity |
scientific article |
Statements
The poset of closure systems on an infinite poset: detachability and semimodularity (English)
0 references
12 January 2011
0 references
Summary: Closure operators on a poset can be characterized by the corresponding closure systems. It is known that in a directed complete partial order (DCPO), in particular in any finite poset, the collection of all closure systems is closed under arbitrary intersection and has a ``detachability'' or ``anti-matroid'' property, which implies that the collection of all closure systems is a lower semimodular complete lattice (and dually, the closure operators form an upper semimodular complete lattice). After reviewing the history of the problem, we generalize these results to the case of an infinite poset where closure systems do not necessarily constitute a complete lattice; thus the notions of lower semimodularity and detachability are extended accordingly. We also give several examples showing that many properties of closure systems on a complete lattice do not extend to infinite posets.
0 references
poset
0 references
closure operator
0 references
closure system
0 references
MLB-closed set
0 references
detachability
0 references
lower semimodularity
0 references
0 references
0 references