Hostname: page-component-848d4c4894-2pzkn Total loading time: 0 Render date: 2024-06-08T18:15:02.377Z Has data issue: false hasContentIssue false

Filter Monads, Continuous Lattices and Closure Systems

Published online by Cambridge University Press:  20 November 2018

Alan Day*
Affiliation:
Lakehead University, Thunder Bay, Ontario
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 notion of a monad (triple) has become increasingly important as an extension of the classical universal algebraic approach to “algebraic” categories. Indeed the categories of algebras arising from a monad seem to be the most natural generalization of Birkhoffs equational classes. Moreover in [2], Barr's concept of a relational model of a monad also coincides nicely with both the concepts of partial algebras (when suitably restricted) and (Moore) closure systems.

In this paper, we wish to examine two particular monads determined by filters. The first is the filter monad F = (F, η, 𝛍) over Sets where FX is the set of all (not necessarily proper) filters on X.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Banaschewski, B., Essential extensions of T-spaces (preprint).Google Scholar
2. Barr, M., Relational algebras, Reports of the Mid West Category Seminar IV, S.\MacLane, éd., Springer Lecture Notes 137, New York (1970).Google Scholar
3. Linton, F. E. J., Some aspects of equational categories, Proc. Conf. on Categorical Algebra (La Jolla 1965), pp. 8494 (Springer, Berlin, 1966).Google Scholar
4. MacLane, S., Categories for the working mathematician (Springer-Verlag, New York, 1971).Google Scholar
5. Scott, D., Continuous lattices, Technical Monograph PRG7, Oxford University Computing Laboratory, 1971.Google Scholar