How strong is Church's type theory?

45 Views Asked by At

This article on the Stanford Encyclopedia of Philosophy describes "Church's type theory", i.e. the simply typed lambda calculus together with a set of inference rules and a set of axioms which turn it into a logical system capable of stating and proving mathematical propositions. How strong is this system, relative to more commonly used systems such as ZFC? Would it suffice as a foundation for mathematics?