Results 1  10
of
30
A General Formulation of Simultaneous InductiveRecursive Definitions in Type Theory
 Journal of Symbolic Logic
, 1998
"... The first example of a simultaneous inductiverecursive definition in intuitionistic type theory is MartinLöf's universe à la Tarski. A set U0 of codes for small sets is generated inductively at the same time as a function T0 , which maps a code to the corresponding small set, is defined by re ..."
Abstract

Cited by 79 (9 self)
 Add to MetaCart
(Show Context)
The first example of a simultaneous inductiverecursive definition in intuitionistic type theory is MartinLöf's universe à la Tarski. A set U0 of codes for small sets is generated inductively at the same time as a function T0 , which maps a code to the corresponding small set, is defined by recursion on the way the elements of U0 are generated. In this paper we argue that there is an underlying general notion of simultaneous inductiverecursive definition which is implicit in MartinLöf's intuitionistic type theory. We extend previously given schematic formulations of inductive definitions in type theory to encompass a general notion of simultaneous inductionrecursion. This enables us to give a unified treatment of several interesting constructions including various universe constructions by Palmgren, Griffor, Rathjen, and Setzer and a constructive version of Aczel's Frege structures. Consistency of a restricted version of the extension is shown by constructing a realisability model ...
A finite axiomatization of inductiverecursive definitions
 Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science
, 1999
"... Inductionrecursion is a schema which formalizes the principles for introducing new sets in MartinLöf’s type theory. It states that we may inductively define a set while simultaneously defining a function from this set into an arbitrary type by structural recursion. This extends the notion of an in ..."
Abstract

Cited by 51 (15 self)
 Add to MetaCart
(Show Context)
Inductionrecursion is a schema which formalizes the principles for introducing new sets in MartinLöf’s type theory. It states that we may inductively define a set while simultaneously defining a function from this set into an arbitrary type by structural recursion. This extends the notion of an inductively defined set substantially and allows us to introduce universes and higher order universes (but not a Mahlo universe). In this article we give a finite axiomatization of inductiverecursive definitions. We prove consistency by constructing a settheoretic model which makes use of one Mahlo cardinal. 1
Wellfounded Trees and Dependent Polynomial Functors
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class ..."
Abstract

Cited by 44 (6 self)
 Add to MetaCart
We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed categories.
On universes in type theory
 191 – 204
, 1998
"... The notion of a universe of types was introduced into constructive type theory by MartinLöf (1975). According to the propositionsastypes principle inherent in ..."
Abstract

Cited by 35 (8 self)
 Add to MetaCart
(Show Context)
The notion of a universe of types was introduced into constructive type theory by MartinLöf (1975). According to the propositionsastypes principle inherent in
Intepreting classical theories in constructive ones
"... Abstract. A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first and secondorder arithmetic, bounded arithmetic, and admissible set theory.?1. Introduction. Proof theory was develop ..."
Abstract

Cited by 25 (13 self)
 Add to MetaCart
(Show Context)
Abstract. A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first and secondorder arithmetic, bounded arithmetic, and admissible set theory.?1. Introduction. Proof theory was developed, in part, as a way to reconcile classical and constructive aspects of mathematical reasoning. Given this historical fact, it is not surprising that over the years proof theorists have invested a good deal of effort in reducing classical theories to constructive ones. Elegant in its simplicity, the G6delGentzen doublenegation interpretation works
Wellordering proofs for MartinLöf Type Theory
 Annals of Pure and Applied Logic
, 1998
"... We present wellordering proofs for MartinLof's type theory with Wtype and one universe. These proofs, together with an embedding of the type theory in a set theoretical system as carried out in [Set93] show that the proof theoretical strength of the type theory is precisely ## 1# I+# , whi ..."
Abstract

Cited by 24 (11 self)
 Add to MetaCart
(Show Context)
We present wellordering proofs for MartinLof's type theory with Wtype and one universe. These proofs, together with an embedding of the type theory in a set theoretical system as carried out in [Set93] show that the proof theoretical strength of the type theory is precisely ## 1# I+# , which is slightly more than the strength of Feferman's theory T 0 , classical set theory KPI and the subsystem of analysis (# 1 2 CA)+(BI). The strength of intensional and extensional version, of the version a la Tarski and a la Russell are shown to be the same. 0 Introduction 0.1 Proof theory and Type Theory Proof theory and type theory have been two answers of mathematical logic to the crisis of the foundations of mathematics at the beginning of the century. Proof theory was originally established by Hilbert in order to prove the consistency of theories by using finitary methods. When Godel showed that Hilbert's program cannot be carried out as originally intended, the focus of proof theory ch...
Collection Principles in Dependent Type Theory
 Types for Proofs and Programs, International Workshop, TYPES 2000
, 2001
"... We introduce logicenriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We introduce logicenriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logicenriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the doublenegation interpretation.
Presheaf models of constructive set theories
, 2004
"... Abstract. We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic S ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic Set Theory and sketch an application to an independence result. 1. Variable sets in foundations and practice Presheaves are of central importance both for the foundations and the practice of mathematics. The notion of a presheaf formalizes well the idea of a variable set, that is relevant in all the areas of mathematics concerned with the study of indexed families of objects [19]. One may then readily see how presheaves are of interest also in foundations: both Cohen’s forcing models for classical set theories and Kripke models for intuitionistic logic involve the idea of sets indexed by stages. Constructive aspects start to emerge when one considers the internal logic of categories of presheaves. This logic, which does not include classical principles such as the law of the excluded middle, provides a useful language to manipulate objects
Intuitionistic Choice and Classical Logic
 Arch. Math. Logic
, 1997
"... this paper we show how to combine the unrestricted countable choice, induction on infinite wellfounded trees and restricted classical logic in a constructively given model. For readers faniliar with intuitionistic systems [14], we may succinctly describe the theory we interpret as follows. Expand t ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
(Show Context)
this paper we show how to combine the unrestricted countable choice, induction on infinite wellfounded trees and restricted classical logic in a constructively given model. For readers faniliar with intuitionistic systems [14], we may succinctly describe the theory we interpret as follows. Expand the extensional version of HA