Abstract

This paper proves the non-derivability of induction in second order dependent type theory (P 2). This is done by providing a model construction for P 2, based on a saturated sets like interpretation of types as sets of terms of a weakly extensional combinatory algebra. We give countermodels in which the induction principle over natural numbers is not valid. The proof does not depend on the specic encoding for natural numbers that has been chosen (like e.g. polymorphic Church numerals), so in fact we prove that there can not be an encoding of natural numbers in P2 such that the induction principle is satised. The method extends immediately to other data types, like booleans, lists, trees, etc. In the process of the proof we establish some general properties of the models, which we think are of independent interest. Moreover, we show that the Axiom of Choice is not derivable in P 2. 1 Introduction In second order dependent type theory, P 2, we can encode all kinds of ...