The presence of lattice theory in discrete problems of mathematical social sciences. Why

Mathematical social sciences

Volumn 46, Issue 2, 2003, Pages 103-144

  Monjardet, Bernard ^a  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Binary relation; Closure operator; Closure system; Entailment relation; Galois lattice; Implication; Lattice; Locally distributive lattice; Set system

Indexed keywords

EID: 0141465207     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-4896(03)00072-6     Document Type: Article

References (90)

1. Adams E.N.III N-trees as nestings: complexity, similarity and consensus Journal of Classification 32 1986 299-317
2. Alkan A. On preferences over subsets and the lattice structure of stable matchings Review Economic Design 6 2001 99-111
3. Armstrong W.W. Dependency structures of data base relationships Information Processing 74 1974 580-583
4. Avann S.P. Locally atomic upper locally distributive lattices Mathematische Annalen 175 1968 320-336
5. Barbut M. Note sur l'algèbre des techniques d'analyse hièrarchique. In: Matalon B. (Ed.), L'analyse hiérarchique 1965 Gauthier-VillarsParis
6. Barbut M. Monjardet B. Ordre et Classification, Algèbre et Combinatoire, tomes I et II 1970 Hachette Paris
7. Barthélemy J.P.Monjardet B.The median procedure in cluster analysis and social choice theory Mathematical Social Science 1 1981 235-268
8. Barthélemy J.P.Janowitz M.F.A formal theory of consensus SIAM Journal of Discrete Mathematics 4 1991 305-322
9. Barthélemy J.P.Leclerc B.Monjardet B.Ensembles ordonnés et taxonomie mathématique Annals of Discrete Mathematics 23 1984 523-58
10. Behrendt G. Maximal antichains in partially ordered sets Ars Combinatoria C25 1988 149-157
11. Bertet, K., Nebut, M., 2002. Efficient algorithms on the family associated to an implicational system, preprint.
12. Bilbao J.M. Cooperative Games on Combinatorial Structures 2000 Kluwer
13. Bilbao J.M. Edelman P.H. The Shapley value on convex geometries Discrete Applied Mathematics 1031-3 2000 33-40
14. Birkhoff G. Lattice Theory third ed. 1940 1967 American Mathematical Society Providence
15. Birkhoff G. What can lattices do for you. In: Abbot J.C. (Ed.), Trends in Lattice Theory 1970 1-40 Van NostrandNew York
16. Blair C. Every finite distributive lattice is a set of stable matchings Journal of Cominatorial Theory (A) 37 1984 353-356
17. Boole, G., 1847. The Mathematical Analysis of Logic. Cambridge.
18. Buchi J.R. Finite Automata, their Algebras and Grammars. Towards a Theory of Formal Expressions 1989 Springer
19. Burosch G. Demetrovics J. Katona G. The poset of closures as model of changing databases Order 4 1987 30-59
20. Caspard N. A characterization theorem for the canonical basis of a closure operator Order 163 1999 227-230
21. Caspard N. Monjardet B. The lattice of closure systems, closure operators and implicational systems on a finite set: a survey Discrete Applied Mathematics 1272 2003 241-269
22. Crapo H. Rota G.C. On the Foundations of Combinatorial Theory II: Combinatorial Geometries 1970 MIT Press Cambridge, MA
23. Crown G.D. Janowitz M.F. Powers R.C. Neutral consensus functions Mathematical Social Sciences 253 1993 231-250
24. Davey B.A. Priestley H.A. Introduction to Lattices and Order 1990 Cambridge University Press Cambridge
25. Dedekind R. Über Zelegungen von Zahlen durch ihre grösten gemeinsamen Teiler Gesammelte Werke 2 1900 103-148
26. Demetrovics J. Hua N.S. Databases, closure operations and Sperner families. In: Frank P. et al. (Ed.), Extremal Problems for Finite Sets 1991 199-203 János Bolyai Mathematical Society Budapest
27. Demetrovics J. Libkin L.O. Muchnik I.B. Functional dependencies in relational databases: a lattice point of view Discrete Applied Mathematics 40 1992 155-185
28. Dilworth R.P. Lattices with unique irreducible representations Annals of Mathematics 41 1940 771-777
29. Doignon J.P. Falmagne J.C. Knowledge Spaces 1999 Springer Berlin
30. Domenach F. Leclerc B. On the roles of Galois connections in classification. In: Schwaiger M. Opitz O. (Eds.), Explanatory Data Analysis in Empirical Research 2002 31-40 SpringerBerlin
31. Domenach, F., Leclerc, B., 2003. Closure systems, implicational systems, overhanging relations and the case of hierarchical classification. Mathematics Social Science, In press.
32. Duntsch I. Gediga G. Rough Set Data Analysis: A Road to Non-Invasive Knowledge Discovery 2000 Methodos Publishers
33. Duntsch I. Gediga G. A note on the correspondence among entail relations, rough set dependencies and logical consequence Journal of Mathematical Psychology 45 2001 393-401
34. Duquenne V. What can lattices do for experimental designs Mathematical Social Sciences 11 1986 243-281
35. Duquenne V. The core of finite lattice Discrete Mathematics 882-3 1991 133-147
36. Duquenne V. glad (General Lattice Analysis and Design): a Fortran Program for a glad User 1992 Maison des Sciences de l'HommeParis
37. Duquenne V. Models of possessions and lattice analysis Social Science Information 2 1995 253-267
38. Duquenne V. Latticial structure in data analysis Theoretical Computer Science 217 1999 407-436
39. Edelman P.H. Jamison R.E. The theory of convex geometries Geometriae Dedicata 19 1985 247-270
40. Edelman P.H. Saks M.E. Combinatorial representations and convex dimension of convex geometries Order 51 1988 23-32
41. Faigle U. Kern W. The Shapley value for cooperative games under precedence constraints International Journal of Game Theory 21 1992 249-266
42. Fleiner T. A fixed-point approach to stable matchings and some applications Mathematics of Operations Research 281 2003 103-126
43. Gabbay D.M. Theoretical foundations for non-monotonic reasoning in expert systems. In: Apt K.R. (Ed.), Logics and Models of Concurrent Systems 1985 439-457 SpringerBerlin
44. Gale D. Shapley M. College admissions and the stability of marriage American Mathematical Monthly 69 1962 9-15
45. Ganter B. Wille R. Formal Concept Analysis, Mathematical Foundations 1999 Springer Berlin
46. Gilboa I. Lehrer E. Global games International Journal of Game Theory 20 1991 129-147
47. Guigues L. Duquenne V. Familles minimales d'implications informatives résultant d'un tableau de données binaires Mathématiques et Sciences Humaines 95 1986 5-18
48. Grätzer G. General Lattice Theory 1991 Birkhäuser Verlag Stuttgart
49. Gusfield D. Irving R.W. The Stable Marriage Problem Structure and Algorithms 1989 MIT Press Cambridge
50. Hausdorff, F., 1914. Grundzüge der Mengenlehere, Leipzig.
51. Hertz P. Über Axiomensysteme für beliebige Satzsysteme Mathematische Annalen 101 1929 457-514
52. Jamison-Waldner R.E. Copoints in antimatroïds Congressum Numerantium 29 1980 535-544
53. Janowitz M.F. An ordinal model for cluster analysis-15 years in retrospect. In: Gaul W. Pfeifer D. (Eds.), From Data to Knowledge: Theoretical and Practical Aspects of Classification, Data Analysis and Knowledge Organization 1995 58-72 SpringerBerlin
54. Knuth D. Mariages Stables 1976 Montréal University Press Montréal
55. Korte B. Lovasz L. Schrader R. Greedoids 1991 Springer Berlin
56. Koshevoy G.A. Choice functions and abstract convex geometries Mathematical Social Sciences 381 1999 35-44
57. Kuznetsov S.O. On computing the size of a lattice and related decision problems Order 18 2001 313-321
58. Leclerc B. Lattice valuations, medians and majorities Discrete Mathematics 111 1993 345-356
59. Leclerc B. Monjardet B. Latticial theory of consensus. In: Barnett W. Moulin H. Salles M. Schofield N. (Eds.), Social Choice, Welfare and Ethics 1994 239-252 Cambridge University Press Cambridge
60. Maier D. The Theory of Relational Data Bases 1983 Computer Science Press
61. Magnien C. Phan H.D. Vuillon L. Characterization of lattices induced by (extended) Chip Firing Games Discrete Mathematics and Theoretical Computer Sciences Proceedings 2001 229-244
62. Markowsky G. The factorization and representation of lattices Transactions of the American Mathematical Society 203 1975 185-200
63. Martin N.M. Pollard S. Closure Spaces and Logic 1996 Kluwer
64. Monjardet B. The consequences of Dilworth's work on lattices with unique irreducible decompositions. In: Bogart K.P. Freese R. Kung J. (Eds.), The Dilworth Theorems Selected Papers of Robert P. Dilworth 1990 192 201 BirkhäuserBoston
65. Monjardet B. Raderanirina V. The duality between the anti-exchange closure operators and the path independent choice operators on a finite set Mathematical Social Sciences 412 2001 131-150
66. Monjardet, B., Raderanirina, V., 2003. Lattice of choice functions and consensus problems, Social choice and Welfare, in press.
67. Moore, E.H., 1909. On a form of general analysis with applications to linear differential and integral equations. In: Atti del IV Congr. Int. dei Mat. II. Roma, pp. 98-114.
68. Morvan M. Nourine L. Simplicial elimination schemes, extremal lattices and maximal antichain lattices Order 132 1996 159-173
69. Nicoletti G. White N. Axioms systems Theory of Matroids 1986 Cambridge University Press Cambridge
70. Nourine, L., 2000. Une structuration algorithmique de la théorie des treillis, thèse d'habilitation, Université de Montpellier II.
71. Novotny M. Dependence spaces of information systems. In: Orlowska E. (Ed.), Incomplete Information. Rough Set Analysis 1997 193-246 Physica Verlag Heidelberg
72. Novotny J. Pawlak Z. Algebraic theory of independence in information systems Fundamenta Informaticae 14 1991 454-476
73. Novotny J. Novotny M. Notes on the algebraic approach to information systems Fundamenta Informaticae 16 1992 263-273
74. Orlowska E. (Ed.), Incomplete Information. Rough Set Analysis 1997 Physica VerlagHeidelberg
75. Pawlak Z. Rough sets International Journal Computing and Information Science 11 1982 341-356
76. Peirce C.S. On the algebra of logic American Journal of Mathematics 3 1880 15-57
77. Peirce C.S. On the logic of number American Journal of Mathematics 4 1881 85-95
78. Reuter K. The jump number and the lattice of maximal antichains Discrete Mathematics 88 1991 289-307
79. Roth A.E. Sotomayor M. Two Sided Matching: A Study in Game-Theoretic Modeling and Analysis 1990 Cambridge University Press Cambridge
80. Schröder E. In: Vorlesungenûber die Algebra der Logik vol. 1 1890 191-281 Teubner Verlag Leipzig
81. Scott D.S. Completeness and axiomatizability in many-valued logics. In: Henkin L. et al. (Ed.), Proceedings of the Tarski Symposium, Proceedings of Symposia in Pure Mathematics 25 1974 411-435 American Mathematical Society Providence
82. Scott D.S. Domains for denotational semantics. In: Nielsen M. Schmidt E.T. (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science 140 1982 577-613 Springer Berlin, Heidelberg
83. Speed T.P. What is analysis of variance The Annals of Statistics 15 1987 885-941
84. Stern M. Semimodular Lattices, Encyclopedia of Mathematics 1999 Cambridge University Press Cambridge
85. Tarski A. Fundamentale Begriffe der Methodologie der Deductiven Wissenchaften Monatshefte fur Mathematik und Physik 37 1930 361-404
86. White N. (Ed.), Theory of Matroids 1986 Cambridge University Press Cambridge
87. Wild M. A theory of finite closure spaces based on implications Advances in Mathematics 1081 1994 118-139
88. Wild, M., 1995. Computations with finite closure systems and implications. In: Du, Z., Li, M., (Eds.), Computing and Combinatorics, Lecture Notes in Computer Science 959. Springer, Berlin, Heidelberg, pp. 111-120.
89. Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I. (Ed.), Ordered Sets 1982 445-470 D. Reidel Dordrecht
90. Winksel G. Larsen K.G. Using information systems to solve domain equations recursively. In: Kahn G. Plotkin G.D. (Eds.), Lecture Notes in Computer Science 173 1984 109-130 Springer Berlin, Heidelberg