The Lattice of Closure Systems, Closure Operators and Implicational Systems on a Finite Set: A Survey
N. Caspard and
Papiers d'Economie MathÃ©matique et Applications from UniversitÃ© PanthÃ©on-Sorbonne (Paris 1)
We present a survey of properties of the lattice of closure systems (families of subsets of a set S containing S and closed by set intersection) on a finite set S with proofs of the more significant results. In particular, we prove that this lattice is atomistic and lower bounded and that there exists a canonical basis allowing to represent any closure system by "implicational" closure systems. The notion of closure system has many cryptomorphic versions, especially the notions of closure operator and of (full) implicational system, occuring in many fields of pure or applied mathematics and of computer science.
Keywords: COMPUTERS; CLOSURE SYSTEM; DEPENDENCE RELATION (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (10) Track citations by RSS feed
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:fth:pariem:2000.120
Access Statistics for this paper
More papers in Papiers d'Economie MathÃ©matique et Applications from UniversitÃ© PanthÃ©on-Sorbonne (Paris 1) France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().