COMPUTER THEOREM PROVING AND HOTT

被引:1
作者
Leslie-Hurd, Joe [1 ]
Haworth, G. Mc C. [2 ]
机构
[1] Intel Corp, Portland, OR 97124 USA
[2] Univ Reading, Reading RG6 6AH, Berks, England
关键词
D O I
10.3233/ICG-2013-36204
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the 'LT' LOGIC THEORY MACHINE of Newell, Shaw and Simon. In game-playing terms, the 'initial position' is the core set of axioms chosen for the particular logic and the 'moves' are the rules of inference. Now, the Univalent Foundations Program at IAS Princeton and the resulting 'HoTT' book on Homotopy Type Theory have demonstrated the success of a new kind of experimental mathematics using computer theorem proving.
引用
收藏
页码:100 / 103
页数:4
相关论文
共 13 条
[1]  
[Anonymous], 2001, MECH PROOF
[2]  
[Anonymous], 2015, Proofs and refutations: The logic of mathematical discovery
[3]  
Godel, 1931, MONATSHEFTE MATH PHY, V38, P173
[4]  
Gonthier, 2013, P POPL 13, P1
[5]  
Gonthier G., 2008, Notices Amer. Math. Soc., V55, P1382
[6]  
Hurd J, 2010, LECT NOTES COMPUT SC, V6048, P221
[7]  
Mann A., 2003, THESIS U COLORADO
[8]   Adapting the International System of Units to the twenty-first century [J].
Mills, Ian M. ;
Mohr, Peter J. ;
Quinn, Terry J. ;
Taylor, Barry N. ;
Williams, Edwin R. .
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2011, 369 (1953) :3907-3924
[9]  
Newell A., 1957, P W JOINT COMP C, p[218, 219]
[10]  
Shulman G., 2013, HOTT BOOK