Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T00:12:29.782Z Has data issue: false hasContentIssue false

Constructive complete distributivity. I

Published online by Cambridge University Press:  24 October 2008

Barry Fawcett
Affiliation:
Department of Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Canada
R. J. Wood
Affiliation:
Department of Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Canada
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1990