谓词Transformers、（co）Monads和归结
Predicate Transformers, (co)Monads and Resolutions
摘要：
这篇简短的笔记包含了关于幂集上闭包/内部运算符的因式分解定理的随机想法，这让人想起单子/共单子的分解概念。这个问题起源于形式拓扑学，但本身很有趣。结果建设性地保持（即使它经典地有几个变化）;但通常不是谓词性的（在这个意义上，插值不会由一个集合给出）。对于那些不熟悉预测性问题的人，我们来看看一个“经典”版本，其中我们限制了插值的大小。
英文摘要：
This short note contains random thoughts about a factorization theorem for closure/interior operators on a powerset which is reminiscent to the notion of resolution for a monad/comonad. The question originated from formal topology but is interesting in itself. The result holds constructively (even if it classically has several variations); but usually not predicatively (in the sense that the interpolant will no be given by a set). For those not familiar with predicativity issues, we look at a ``classical'' version where we bound the size of the interpolant.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
