| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4663141 | Journal of Applied Logic | 2006 | 24 Pages |
This paper presents Automath encodings (which are also valid in LF/λP) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to find out which foundation is the simplest.The systems analyzed in this way are two kinds of set theory (ZFC and NF), two systems based on Church's higher order logic (Isabelle/Pure and HOL), three kinds of type theory (the calculus of constructions, Luo's extended calculus of constructions, and Martin-Löf's predicative type theory) and one foundation based on category theory.The conclusions of this paper are that the simplest system is type theory (the calculus of constructions), but that type theories that know about serious mathematics are not simple at all. In that case the set theories are the simplest. If one looks at the number of concepts needed to explain such a system, then higher order logic is the simplest, with twenty-five concepts. On the other side of the scale, category theory is relatively complex, as is Martin-Löf's type theory.(The full Automath sources of the contexts described in this paper are one the web at http://www.cs.ru.nl/~freek/zfc-etc/.)
