Skip to main content Accessibility help

Constructive complete distributivity. I

  • Barry Fawcett (a1) and R. J. Wood (a1)


The relationships, in many cases equivalences, between lattice distributivity, adjunction and continuity have been studied by many authors, for example [1, 3–8, 12, 13, 15, 17–20, 22, 23]. Very roughly, we refer to the following circle of ideas. Let L be an ordered set, and L a class of subsets of L, and suppose that L has a supremum for each element in L. We might say that L has -sups. The ‘distributivity’ we refer to is that of infs over -sups. The ‘adjunction’ is that given by a left adjoint to the map V: L→L. Now the latter has a left adjoint if and only if it preserves infs, and this means roughly that the -sup of an intersection is an inf of -sups. When one does succeed in identifying the -sup of an intersection as a -sup of infs, one has an instance of distributivity.



Hide All
[1]Bandelt, H.-J. and Erné, M.. The category of Z-continuous posets. J. Pure Appl. Algebra 30 (1983), 219226.
[2]Barr, M.. Toposes Triples and Theories (Springer-Verlag, 1985).
[3]Bruns, G.. Distributivität und subdirekte Zerlegbarkeit vollständiger Verbände. Arch. Math. (Basel) 12 (1961), 6166.
[4]Bruns, G.. Darstellungen und Erweiterungen geordnete Mengen. I. J. Reine Angew. Math. 209 (1962), 167200.
[5]Bruns, G.. Darstellungen und Erweiterungen geordnete Mengen. II. J. Reine Angew. Math. 210 (1962), 123.
[6]Büchi, J. R.. Die Boolesche Partialordnung und die Paarung von Gefügen. Portugal Math. 7 (1948), 119190.
[7]Büchi, J. R.. Representation of complete lattices by sets. Portugal Math. 2 (1952), 149186.
[8]Day, A.. Filter monads, continuous lattices and closure systems. Canad. J. Math. 27 (1975), 5059.
[9]Diaconescu, R.. Axiom of choice and complementation. Proc. Amer. Math. Soc. 51 (1975), 176178.
[10]Dugundji, J.. Topology (Allyn & Bacon Inc. Publishers, 1966).
[11]Fawcett, B. and Wood, R. J.. Constructive complete distributivity. II. (In preparation.)
[12]Hoffman, R.-E.. Continuous posets and adjoint sequences. Semigroup Forum 18 (1979), 173188.
[13]Johnstone, P. T.. Stone Spaces (Cambridge University Press, 1982).
[14]Kock, A. and Wraith, G. C.. Elementary toposes. Aarhus Universitet Lecture Series no. 30 (1971).
[15]Lawson, J. D.. The duality of continuous posets. Houston J. Math. 5 (1979), 357386.
[16]Mikkelsen, C. J.. Lattice theoretic and logical aspects of elementary topoi. Aarhus Universitet Publ. Series no. 25 (1976).
[17]Novak, D.. Generalization of continuous posets. Trans. Amer. Math. Soc. 272 (1982), 645667.
[18]Raney, G. N.. Completely distributive complete lattices. Proc. Amer. Math. Soc. 3 (1952), 677680.
[19]Raney, G. N.. A subdirect-union representation for completely distributive lattices. Proc. Amer. Math. Soc. 4 (1953), 518522.
[20]Raney, G. N.. Tight Galois connections and complete distributivity. Trans. Amer. Math. Soc. 97 (1960), 418426.
[21]Rubin, H. and Rubin, J.. Equivalents of the Axiom of Choice (North Holland Publishing Company, 1963).
[22]Sikorski, R.. Representation and distributivity of Boolean algebras. Colloq. Math. 8 (1961), 113.
[23]Sikorski, R.. Boolean Algebras (Academic Press, 1964).
[24]Street, R. and Walters, R. F. C.. Yoneda structures on 2-categories. J. Algebra 50 (1978), 350379.

Constructive complete distributivity. I

  • Barry Fawcett (a1) and R. J. Wood (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed