## Journal of Symbolic Logic

### An Intensional Type Theory: Motivation and Cut-Elimination

Paul C. Gilmore

#### Abstract

By the theory TT is meant the higher order predicate logic with the following recursively defined types: (1) 1 is the type of individuals and [] is the type of the truth values: (2) [$\tau_l$,..., $\tau_n$] is the type of the predicates with arguments of the types $\tau_l$,..., $\tau_n$. The theory ITT described in this paper is an intensional version of TT. The types of ITT are the same as the types of TT, but the membership of the type 1 of individuals in ITT is an extension of the membership in TT. The extension consists of allowing any higher order term, in which only variables of type 1 have a free occurrence, to be a term of type 1. This feature of ITT is motivated by a nominalist interpretation of higher order predication. In ITT both well-founded and non-well-founded recursive predicates can be defined as abstraction terms from which all the properties of the predicates can be derived without the use of non-logical axioms. The elementary syntax, semantics, and proof theory for ITT are defined. A semantic consistency proof for ITT is provided and the completeness proof of Takahashi and Prawitz for a version of TT without cut is adapted for ITT: a consequence is the redundancy of cut.

#### Article information

Source
J. Symbolic Logic, Volume 66, Issue 1 (2001), 383-400.

Dates
First available in Project Euclid: 6 July 2007

https://projecteuclid.org/euclid.jsl/1183746377

Mathematical Reviews number (MathSciNet)
MR1825191

Zentralblatt MATH identifier
0980.03007

JSTOR