Going down in (semi)lattices of finite Moore families and convex geometries
Author
Abstract
Suggested Citation
Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00308785
Download full text from publisher
Other versions of this item:
- Gabriela Bordalo & Nathalie Caspard & Bernard Monjardet, 2009. "Going down in (semi)lattices of finite Moore families and convex geometries," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00308785, HAL.
References listed on IDEAS
- Monjardet, Bernard & Raderanirina, Vololonirina, 2001.
"The duality between the anti-exchange closure operators and the path independent choice operators on a finite set,"
Mathematical Social Sciences, Elsevier, vol. 41(2), pages 131-150, March.
- Monjardet, B. & Raderanirina, V., 1999. "The Duality Between the Anti-Exchange Closure Operators and the Path Independent Choice Operators on a Finite Set," Papiers d'Economie Mathématique et Applications 1999-68, Université Panthéon-Sorbonne (Paris 1).
- Monjardet, B. & Raderanirina, V., 2000. "The Duality Between the Anti-Exchange Closure Operators and the Path Independent Choice Operators on a Finite Set," Papiers d'Economie Mathématique et Applications 2000.121, Université Panthéon-Sorbonne (Paris 1).
- Bernard Monjardet & Raderanirina Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00214289, HAL.
- Bernard Monjardet & Raderanirina Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Post-Print halshs-00214289, HAL.
- Hausser Bordelo, G. & Monjardet, B., 1999. "The Lattice of Strict Completions of a Poset," Papiers d'Economie Mathématique et Applications 1999.15, Université Panthéon-Sorbonne (Paris 1).
- Caspard, N. & Monjardet, B., 2000. "The Lattice of Closure Systems, Closure Operators and Implicational Systems on a Finite Set : A Survey," Papiers d'Economie Mathématique et Applications 2000.120, Université Panthéon-Sorbonne (Paris 1).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Bernard Monjardet, 2007.
"Some Order Dualities In Logic, Games And Choices,"
International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 9(01), pages 1-12.
- Bernard Monjardet, 2004. "Some order dualities in logic, games and choices," Cahiers de la Maison des Sciences Economiques b04018, Université Panthéon-Sorbonne (Paris 1).
- Bernard Monjardet, 2007. "Some order dualities in logic, games and choices," Post-Print halshs-00202326, HAL.
- Bernard Monjardet, 2007. "Some order dualities in logic, games and choices," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00202326, HAL.
- Monjardet, Bernard, 2003. "The presence of lattice theory in discrete problems of mathematical social sciences. Why," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 103-144, October.
- V. Danilov & G. Koshevoy & E. Savaglio, 2015. "Hyper-relations, choice functions, and orderings of opportunity sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(1), pages 51-69, June.
- Monjardet, Bernard & Raderanirina, Vololonirina, 2001.
"The duality between the anti-exchange closure operators and the path independent choice operators on a finite set,"
Mathematical Social Sciences, Elsevier, vol. 41(2), pages 131-150, March.
- Monjardet, B. & Raderanirina, V., 1999. "The Duality Between the Anti-Exchange Closure Operators and the Path Independent Choice Operators on a Finite Set," Papiers d'Economie Mathématique et Applications 1999-68, Université Panthéon-Sorbonne (Paris 1).
- Monjardet, B. & Raderanirina, V., 2000. "The Duality Between the Anti-Exchange Closure Operators and the Path Independent Choice Operators on a Finite Set," Papiers d'Economie Mathématique et Applications 2000.121, Université Panthéon-Sorbonne (Paris 1).
- Bernard Monjardet & Raderanirina Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00214289, HAL.
- Bernard Monjardet & Raderanirina Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Post-Print halshs-00214289, HAL.
- Bernard Monjardet & Vololonirina Raderanirina, 2004.
"Lattices of choice functions and consensus problems,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(3), pages 349-382, December.
- Bernard Monjardet & Raderanirina Vololonirina, 2004. "Lattices of choice functions and consensus problems," Post-Print halshs-00203346, HAL.
- Bernard Monjardet & Raderanirina Vololonirina, 2004. "Lattices of choice functions and consensus problems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00203346, HAL.
- repec:ebl:ecbull:v:4:y:2004:i:3:p:1-3 is not listed on IDEAS
- Danilov, V. & Koshevoy, G., 2005. "Mathematics of Plott choice functions," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 245-272, May.
- Vladimir Danilov & Gleb Koshevoy & Ernesto Savaglio, 2012.
"Orderings of Opportunity Sets,"
Working Papers
282, ECINEQ, Society for the Study of Economic Inequality.
- Vladimir Danilov & Gleb Koshevoy & Ernesto Savaglio, 2012. "Orderings of Opportunity Sets," Department of Economics University of Siena 660, Department of Economics, University of Siena.
- Danilov, V. & Koshevoy, G., 2006. "A new characterization of the path independent choice functions," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 238-245, March.
- Matthew Ryan, 2010. "Mixture sets on finite domains," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 33(2), pages 139-147, November.
- Jean Diatta, 2009. "On critical sets of a finite Moore family," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 3(3), pages 291-304, December.
More about this item
Keywords
closure system; cover relation; Moore family; poset of irreducible; semilattice; convex geometry; join-irreducible; ensemble ordonné; famille de Moore; fermeture; géométrie convexe; relation de couverture; sup-irréductible; treillis;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:halshs-00308785. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.