Filter Monads, Continuous Lattices and Closure Systems
Alan Day
Source record
Source: Crossref
Published: Feb 1, 1975
DOI: 10.4153/cjm-1975-008-8
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.