An intuitionistic theory of types with assumptions of high-arity variables

Annals of Pure and Applied Logic 57 (2):93-149 (1992)
  Copy   BIBTEX

Abstract

Bossi, A. and S. Valentini, An intuitionistic theory of types with assumptions of high-arity variables, Annals of Pure and Applied Logic 57 93–149. After an introductory discussion on Martin-Löf's Intuitionistic Theory of Types , the paper introduces the notion of assumption of high-arity variable. Then the original theory is extended in a very uniform way by means of the new assumptions. Some improvements allowed by high-arity variables are shown. The main result of the paper is a normal form theorem for HITT. The detailed proof follows a computability method ‘a la Tait’. The main consequences of the normal form theorem are: the consistency of HITT, which also implies the consistency of ITT, and the computability of any judgement derived within HITT. Besides that, a canonical form theorem is shown: to any derivable judgement we can associate a canonical one whose derivation ends with an introductory rule. The standard disjunction and existential properties follow. Moreover, by using the computational interpretation of types it immediately follows that the execution of any proved correct program terminates

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
Finiteness Axioms on Fragments of Intuitionistic Set Theory.Riccardo Camerlo - 2007 - Notre Dame Journal of Formal Logic 48 (4):473-488.
A double arity hierarchy theorem for transitive closure logic.Martin Grohe & Lauri Hella - 1996 - Archive for Mathematical Logic 35 (3):157-171.

Analytics

Added to PP
2014-01-16

Downloads
15 (#953,911)

6 months
1 (#1,478,830)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The lambda calculus: its syntax and semantics.Hendrik Pieter Barendregt - 1981 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.

Add more references