Univalent Foundations Project ( a modified version of an NSF grant application )
Univalent Foundations Project ( a modified version of an NSF grant application )
复制标题
Univalent 基金会项目(NSF 拨款申请的修改版本)
DOI:
--
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
V. Voevodsky
中科院分区:
文献类型:
--
作者:
V. Voevodsky
1 General outline of the proposed project While working on the completion of the proof of the Bloch-Kato conjecture I have thought a lot about what to do next. Eventually I became convinced that the most interesting and important directions in current mathematics are the ones related to the transition into a new era which will be characterized by the widespread use of automated tools for proof construction and verification. I have started to actively learn about the related subjects around 2003/04. A few years ago I have come up with an idea for a new semantics for dependent type theories-the class of formal systems which are widely used in the theory of programming languages. Unlike the usual semantics which interpret types as sets this " univalent semantics " interprets types as homotopy types. The key property of the univalent interpretation is that it satisfies the univalence axiom a new axiom which makes it possible to automatically transport constructions and proofs between types which are connected by appropriately defined weak equivalences. In 2009/2010 I made a number of presentations on the univalent interpretation which were received with great interest by the type theoretic community. As of today two special events have been planned for the further discussion of the related ideas-a workshop in Oberwolfach in March 2011 and a year long special program at the Institute for Advanced Study in 2012-2013. Eventually it became clear to me that the univalent semantics is just a first step and that I am really working on new foundations of mathematics. The key features of these " univalent foundations " are as follows: 1. Univalent foundations naturally include " axiomatization " of the categorical and higher categorical thinking. 2. Univalent foundations can be conveniently formalized using the class of languages called dependent type systems. 3. Univalent foundations are based on direct axiomatization of the " world " of homotopy types instead of the world of sets. 4. Univalent foundations can be used both for constructive and for non-constructive mathematics. To see what homotopy theory has to do with foundations of mathematics consider the following definitions which take place in the usual homotopy category: A (homotopy) type T is said to be of h-level 0 if it is contractible, A (homotopy) type T is said to be of h-level 1 if for any two points of T the space of paths between these two points …