Models of Intuitionistic Tt and Nf

Let us define the intuitionistic part of a classical theory T as the intuitionistic theory whose proper axioms are identical with the proper axioms of T. For example, Heyting arithmetic HA is the intuitionistic part of classical Peano arithmetic PA. It's a well-known fact, proved by Heyting and Myhill, that ZF is identical with its intuitionistic part. In this paper, we mainly prove that TT, Russell's Simple Theory of Types, and NF, Quine's ''New Foundations,'' are not equal to their intuitionistic part. So, an intuitionistic version of TT or NF seems more naturally definable than an intuitionistic Version of ZF. In the first section, we present a simple technique to build Kripke models of the intuitionistic part of TT (with short examples showing bad properties of finite sets if they are defined in the usual classical way). In the remaining sections, we show how models of intuitionistic NF2 and NF can be obtained from well-chosen classical ones. In these models, the excluded middle win not be satisfied for some non-stratified sentences.