An Intensional Type Theory: Motivation and Cut-Elimination

Journal of Symbolic Logic 66 (1):383-400 (2001)

Abstract
By the theory TT is meant the higher order predicate logic with the following recursively defined types: 1 is the type of individuals and [] is the type of the truth values: [$\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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI http://projecteuclid.org/euclid.jsl/1183746377
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 43,914
Through your library

References found in this work BETA

First-Order Logic.Raymond M. Smullyan - 1975 - Journal of Symbolic Logic 40 (2):237-238.
The Lambda Calculus. Its Syntax and Semantics.H. P. Barendregt - 1984 - Journal of Symbolic Logic 49 (1):301-303.
Abstract Entities.Wilfrid Sellars - 1963 - Review of Metaphysics 16 (4):627 - 671.

View all 9 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Intensional Models for the Theory of Types.Reinhard Muskens - 2007 - Journal of Symbolic Logic 72 (1):98-118.
Cut-Elimination for Simple Type Theory with an Axiom of Choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.
Cut-Elimination for Simple Type Theory with an Axiom of Choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.
The Inconsistency of Higher Order Extensions of Martin-Löf's Type Theory.Bart Jacobs - 1989 - Journal of Philosophical Logic 18 (4):399 - 422.
Higher Type Categories.Martin Dowd - 1993 - Mathematical Logic Quarterly 39 (1):251-254.
An Untyped Higher Order Logic with Y Combinator.James H. Andrews - 2007 - Journal of Symbolic Logic 72 (4):1385 - 1404.
Well-Ordering Proofs for Martin-Löf Type Theory.Anton Setzer - 1998 - Annals of Pure and Applied Logic 92 (2):113-159.
A Simple Type Theory With Partial Functions And Subtypes.William M. Farmer - 1993 - Annals of Pure and Applied Logic 64 (3):211-240.
Syntactic Calculus with Dependent Types.Aarne Ranta - 1998 - Journal of Logic, Language and Information 7 (4):413-431.

Analytics

Added to PP index
2009-01-28

Total views
40 ( #210,499 of 2,266,272 )

Recent downloads (6 months)
5 ( #283,339 of 2,266,272 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature