Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-09T06:31:35.974Z Has data issue: false hasContentIssue false

Models of intuitionistic TT and NF

Published online by Cambridge University Press:  12 March 2014

Daniel Dzierzgowski*
Affiliation:
Université Catholique de Louvain, Département de Mathématique, Chemin du Cyclotron 2, B-1348 Louvain-la-Neuve (Belgium), E-mail: ddz@agel.ucl.ac.be

Abstract

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 will not be satisfied for some non-stratified sentences.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable