This is a preview of subscription content, log in via an institution to check access.
References
S. P. Avann (1961a) Application of the join-irreducible excess function to semimodular lattices,Math. Ann. 142, 345–354.
S. P. Avann (1961b). Distributive properties in semimodular lattices,Math. Z. 76, 283–287.
S. P. Avann (1964) Increases in the join-excess function in a lattice,Math. Ann. 154, 420–426.
S. P. Avann (1968) Locally atomic upper locally distributive lattices,Math. Ann. 175, 320–336.
S. P. Avann (1972) The lattice of natural partial orders,Aequationes Math. 8, 95–102.
J. P. Barthelemy, Cl. Flament, and B. Monjardet (1982) Ordered sets and social sciences, inOrdered Sets (ed. I. Rival), D. Reidel, Dordrecht, pp. 721–758.
M. K. Bennett (1968) A lattice characterization of convexity,J. Comb. Theory 5, 198–202.
M. K. Bennett (1971) Generalized convexity lattices,J. Comb. Theory 10, 140–144.
M. K. Bennett (1980) Convexity closure operators,Alg. Univ. 10, 345–354.
G. Boulaye (1967) Sous-arbres et homomorphismes à classes connexes dans un arbre inTheory of Graphs International Symposium, Gordon and Breach, New York, pp. 47–50.
G. Boulaye (1968a) Sur l'ensemble ordonné des parties connexes d'un graphe connexe,R.I.R.O., 13–25.
G. Boulaye (1968b) Notion d'extension dans les treillis et méthodes boléennes,Rev. Roum. Maths. Pures Appl. 13–9, 1225–1231.
P. Crawley and R. P. Dilworth (1973) Algebraic theory of lattices, Prentice Hall, Inc., Englewood Cliffs.
R. A. Dean and G. Keller (1968) Natural partial orders,Canad. J. Math. 20, 535–554.
R. P. Dilworth (1940) Lattices with unique irreducible decompositions,Ann. Math. 41, 771–777.
R. P. Dilworth (1941) Ideals in Birkhoff lattices,Trans. Amer. Math. Soc. 49, 325–353.
R. P. Dilworth (1961) Structure and decomposition of lattices, inLattice Theory, Amer. Math. Soc. Providence, pp. 3–16.
R. P. Dilworth and P. Crawley (1960) Decomposition theory for lattices without chain conditions,Trans. Amer. Math. Soc. 96, 1–22.
P. H. Edelman (1980) Meet-distributive lattices and the antiexchange closure,Alg. Univ. 10, 290–299.
P. H. Edelman (1982) The lattice of convex sets of an oriented matroid,J. Comb. Theory B33, 239–244.
P. H. Edelman and P. Klingsberg (1982) The subposet lattice and the order polynomialEur. J. Comb. 2, 341–346.
C. Greene and G. Markowsky (1974) A combinatorial test for local distributivity, Research Report RC 5129, IBM T. J. Watson Research Center, Yorktown Heights, New York.
R. E. Jamison (1970) A development of axiomatic convexity, Tech. Report 48, Clemson University Math., pp. 15–20.
R. E. Jamison (1980) Copoints in antimatroïds,Congr. Num. 29, 535–544.
R. E. Jamison (1982) A perspective on abstract convexity: classifying alignments by varieties, inConvexity and Related Combinatorial Geometry, (eds. D. G. Kay and M. Breen), Marcel Dekker, New York, pp. 113–150.
G. Markowsky (1980) The representation of posets and lattices by sets,Alg. Univ. 11, 173–192.
J. L. Pfaltz (1969) Semi-homomorphisms of semimodular lattices,Proc. Amer. Math. Soc. 22, 418–425.
J. L. Pfaltz (1971) Convexity in directed graphs,J. Comb. Theory 10, 143–162.
J. S. Pym and H. Perfect (1970) Submodular functions and independence structures,J. Math. Anal. Appl. 30, 1–31.
N. Polat (1976) Treillis de séparation des graphes,Canad. J. Math. 28, 725–752.
I. Rival (ed.) (1982)Ordered Sets, D. Reidel, Dordrecht.
R. P. Stanley (1974) Combinatorial reciprocity theorems,Adv. Math. 14, 194–253.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Monjardet, B. A use for frequently rediscovering a concept. Order 1, 415–417 (1985). https://doi.org/10.1007/BF00582748
Issue Date:
DOI: https://doi.org/10.1007/BF00582748