dcpos上的闭包运算符
Closure operators on dcpos
摘要:
我们研究了至少是dcpos的偏序集上的闭包算子的集体性质。第一个定理确定了这篇论文的基调:它讲述了dcpo上的一组预闭包映射如何确定它上面的最小闭包算子,并宣布了相关的归纳原理,以及它的兄弟,正归纳原理。利用这一定理,我们证明了dcpo上闭包算子的偏序集是一个完全格,从而给出了dcpo上Tarski定理的构造性证明.接着我们构造了dcpo上Scott-连续闭包算子的完全格中的并,证明了核在预标架上的完全格是一个标架,并给出了所有核在标架上的标架的特殊情况下的一些构造.在霍夫曼-米斯洛夫-约翰斯通定理的冗长证明中,我们展示了正向归纳法的效用,并将其应用于关键引理的证明中。之后,我们转移了一个观点,并证明了一些结果,类似于dcpos的结果,某些特殊的子偏序集有足够的极大元的偏序集,这些结果实际上专门dcpos,但在使用选择公理的代价。最后,我们指出了两个凸几何与封闭算子的dcpo。
英文摘要:
We examine collective properties of closure operators on posets that are at least dcpos. The first theorem sets the tone of the paper: it tells how a set of preclosure maps on a dcpo determines the least closure operator above it, and pronounces the related induction principle, and its sibling, the obverse induction principle. Using this theorem we prove that the poset of closure operators on a dcpo is a complete lattice, and then provide a constructive proof of the Tarski's theorem for dcpos. We go on to construct the joins in the complete lattice of Scott-continuous closure operators on a dcpo, and to prove that the complete lattice of nuclei on a preframe is a frame, giving some constructions in the special case of the frame of all nuclei on a frame. In the rather drawn-out proof if the Hofmann-Mislove-Johnstone theorem we show off the utility of the obverse induction, applying it in the proof of the crucial lemma. After that we shift a viewpoint and prove some results, analogous to the results about dcpos, for posets in which certain special subposets have enough maximal elements; these results actually specialize to dcpos, but at the price of using the axiom of choice. We conclude by pointing out two convex geometries associated with closure operators on a dcpo.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。