依赖类型论中良基树的拓扑对应物
A topological counterpart of well-founded trees in dependent type theory
AI总结:
本文在依赖类型论中为良基树(W-types)构建了基于内涵生成基本覆盖的拓扑对应物,证明了二者在Homotopy Type Theory和Agda实现中的相互编码性,并在Minimalist Foundation框架中通过良基谓词重构了该等价关系。
摘要:
在依赖类型论中,我们通过使用内涵生成基本覆盖(形式拓扑中引入的内涵生成超格概念的证明相关版本),为良基树(简称W-types)提供了拓扑对应物。具体而言,我们首先证明在Homotopy Type Theory中,W-types与证明相关的内涵生成基本覆盖在命题层面可相互编码。其次,我们在intensional Martin-Loef's type theory的Agda实现中证明它们在定义层面可相互编码。最后,我们通过引入良基谓词作为依赖W-types的谓词逻辑对应物,在Minimalist Foundation框架中重新构建了这种等价关系。所有结果均在Agda证明助手中得到验证。
英文摘要:
Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology under the name of inductively generated basic covers. In more detail, we show, firstly, that in Homotopy Type Theory, W-types and proof relevant inductively generated basic covers are propositionally mutually encodable. Secondly, we prove they are definitionally mutually encodable in the Agda implementation of intensional Martin-Loef's type theory. Finally, we reframe the equivalence in the Minimalist Foundation framework by introducing well-founded predicates as the logical counterpart for predicates of dependent W-types. All the results have been checked in the Agda proof-assistant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。