Is ZF a hack?. Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics

Journal of Applied Logic

Volumn 4, Issue 4, 2006, Pages 622-645

  Wiedijk, Freek ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Automath; Calculus of constructions; Category theory; Formalization of mathematics; Foundation of mathematics; Higher order logic; HOL; Isabelle; Logical frameworks; Martin L f type theory; New foundations; NF; Set theory; Type theory; Zermelo Fraenkel; ZF; ZFC

Indexed keywords

DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); FORMAL LOGIC; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; SET THEORY;

AUTOMATH ENCODINGS; CATEGORY THEORY; FOUNDATION OF MATHEMATICS; HIGHER ORDER LOGIC; ISABELLE; LOGICAL FRAMEWORKS; NEW FOUNDATIONS; TYPE THEORY; ZERMELO-FRAENKEL; ZFC;

COMPUTATIONAL COMPLEXITY;

EID: 33749541870     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.10.011     Document Type: Article

References (17)

1. Aczel P. On relating type theories and set theories. In: Altenkirch T., Naraschewski W., and Reus B. (Eds). Types for Proofs and Programs, Proceedings of Types '98. Lecture Notes in Computer Science vol. 1657 (1999), Springer-Verlag, Berlin. http://www.cs.man.ac.uk/~petera/ts-st.ps.gz
2. The Automath Archive (2004). http://automath.webhop.net/
3. Balaguer M. Platonism and Anti-Platonism in Mathematics (1998), Oxford University Press, New York
4. Barendregt H. Problems in type theory. In: Berger U., and Schwichtenberg H. (Eds). Computational Logic, Proceedings of the NATO Advanced Study Institute on Computational Logic, held in Marktoberdorf, 1997. Series F: Computer and Systems Sciences vol. 165 (1999), Springer-Verlag, Berlin. ftp://ftp.cs.ru.nl/pub/CompMath.Found/marktoberdorf.ps.Z
5. Berghofer S. New features of the Isabelle theorem prover-proof terms and code generation (2000). http://www4.in.tum.de/~berghofe/papers/TYPES2000_slides.ps.gz
6. de Bruijn N.G. Verslag over het project Wiskundige Taal AUTOMATH. Technical Report XAUT033, The Automath Archive, Eindhoven University of Technology (1978). http://www.win.tue.nl/automath/archive/webversion/xaut033/xaut033.html
7. Harrison J. The HOL Light manual (1.1) (2000). http://www.cl.cam.ac.uk/users/jrh/hol-light/manual-1.1.ps.gz
8. Luo Z. ECC, an extended calculus of constructions. Proceedings 4th Annual IEEE Symp. on Logic in Computer Science, LICS'89, Pacific Grove, CA, Los Alamitos, CA (1989), IEEE Computer Society Press 386-395. http://www.dur.ac.uk/~dcs0zl/LICS89.ps.gz
9. McBride C. Dependently typed functional programs and their proofs. PhD thesis, University of Edinburgh (1999). http://www.dur.ac.uk/c.t.mcbride/thesis.ps.gz
10. McLarty C. Challenge axioms, final draft. Message 199802061421.JAA28643@po.cwru.edu, as sent to the FOM mailing list (1998). http://www.cs.nyu.edu/pipermail/fom/1998-February/001181.html
11. Nederpelt R.P., Geuvers J.H., and de Vrijer R.C. Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics vol. 133 (1994), Elsevier Science, Amsterdam
12. Nordström B., Petersson K., and Smith J.M. Programming in Martin-Löf's Type Theory, An Introduction (1990), Oxford University Press, Oxford. http://www.cs.chalmers.se/Cs/Research/Logic/book/book.ps
13. Paulson L.C. The Isabelle Reference Manual (2003). http://isabelle.in.tum.de/doc/Ref.pdf
14. Pfenning F. Logical frameworks. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (1999), Elsevier Science, Amsterdam 1063-1147. http://www-2.cs.cmu.edu/~twelf/notes/handbook00.ps Chapter 17
15. Pfenning F., and Schuermann C. Twelf user's guide, version 1.4 (2002). http://www-2.cs.cmu.edu/~twelf/guide-1-4/twelf.ps
16. Wiedijk F. A new implementation of Automath. J. Automat. Reason. 29 (2002) 365-387. http://www.cs.ru.nl/~freek/aut/aut.ps.gz
17. Wiedijk F. Encoding the HOL Light logic in Coq (2002). http://www.cs.ru.nl/~freek/notes/holl2coq.ps.gz