Taut monads and \(T0\)-spaces. (Q1870523)

The author introduces taut monads and characterizes taut monads in sets by the existence of a support classifier. His motivation is that taut monads are precisely monads for which collection membership is decidable by a functional algorithm. A typical example of a taut monad is the filter monad \(F\) and a monad in sets is taut iff it admits a taut monad map to \(F\). Finitary taut monads in sets coincide with collection monads (introduced by the author in ``Implementing collection classes with monads'' [\textit{E. G. Manes}, Math. Struct. Comput. Sci. 8 , 231--276 (1998; Zbl 0916.68016)]).