TL;DR: In this paper, Kripke models are used to define inductive definitions, trees and ordinals for intuitionistic formal systems, and normalization theorems for systems of natural deduction.
Abstract: Intuitionistic formal systems.- Models and computability.- Realizability and functional interpretations.- Normalization theorems for systems of natural deduction.- Applications of Kripke models.- Iterated inductive definitions, trees and ordinals.- Erratum.
TL;DR: The main results of this paper are interpretations of T0 in intuitionistic arithmetic U0 and of T1 in intuitionist analysis U1 in this paper, where U1 is U0 with quantification over functionals of type (0,0) and the axiom schemata AC00 and of bar induction.
Abstract: T0 will denote Godel's theory T[3] of functionals of finite type (f.t.) with intuitionistic quantification over each f.t. added. T1 will denote T0 together with definition by bar recursion of type o, the axiom schema of bar induction, and the schemaof choice. Precise descriptions of these systems are given below in §4. The main results of this paper are interpretations of T0 in intuitionistic arithmetic U0 and of T1 in intuitionistic analysis is U1. U1 is U0 with quantification over functionals of type (0,0) and the axiom schemata AC00 and of bar induction.
TL;DR: In this article, the conditions générales d'utilisation (http://www.compositio.org/conditions) of the agreement with the Foundation Compositio Mathematica are described.