arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0803.4466math.LO
收藏

关于Martin-Löf型理论中相关积的强度

On the strength of dependent products in the type theory of Martin-Löf

Richard Garner

摘要:

人们可以用抽象和应用运算符来表示马丁-勒夫类型论的依赖积类型,就像那些用于微积分的;或者用引入和消除规则来表示,就像那些用于类型论的其他构造器。我们知道,后者的规则至少与前者一样强:我们证明,它们实际上严格更强。我们还表明,在存在的身份类型,相关产品的消除规则-这是一个“高阶”的推理规则的意义上的Schroeder-Heister-可以重新制定的一阶方式。最后,我们考虑了类型论中的函数外延性原则,它断言一个依赖乘积类型的两个元素在逐点命题上相等,它们本身在命题上相等。我们表明,通常制定的这一原则未能验证一些非常自然的命题等式,并提出了一种替代配方,纠正这一缺陷。

英文摘要:

One may formulate the dependent product types of Martin-Löf type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the other constructors of type theory. It is known that the latter rules are at least as strong as the former: we show that they are in fact strictly stronger. We also show, in the presence of the identity types, that the elimination rule for dependent products--which is a "higher-order" inference rule in the sense of Schroeder-Heister--can be reformulated in a first-order manner. Finally, we consider the principle of function extensionality in type theory, which asserts that two elements of a dependent product type which are pointwise propositionally equal, are themselves propositionally equal. We demonstrate that the usual formulation of this principle fails to verify a number of very natural propositional equalities; and suggest an alternative formulation which rectifies this deficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑