Local Constructive Set Theory and Inductive Definitions
نویسنده
چکیده
Local Constructive Set Theory (LCST) is intended to be a local version of constructive set theory (CST). Constructive Set Theory is an open-ended set theoretical setting for constructive mathematics that is not committed to any particular brand of constructive mathematics and, by avoiding any built-in choice principles, is also acceptable in topos mathematics, the mathematics that can be carried out in an arbitrary topos with a natural numbers object. We refer the reader to [2] for any details, not explained in this paper, concerning CST and the specific CST axiom systems CZF and CZF ≡ CZF+ REA. CST provides a global set theoretical setting in the sense that there is a single universe of all the mathematical objects that are in the range of the variables. By contrast a local set theory avoids the use of any global universe but instead is formulated in a many-sorted language that has various forms of sort including, for each sort α a power-sort Pα , the sort of all sets of elements of sort α . For each sort α there is a binary infix relation ∈α that takes two arguments, the first of sort α and the second of sort Pα . For each formula φ and each variable x of sort α , there is a comprehension term {x : α | φ} of sort Pα for which the following scheme holds.
منابع مشابه
Non-deterministic inductive definitions
We study a new proof principle in the context of constructive ZermeloFraenkel set theory based on what we will call “non-deterministic inductive definitions”. We give applications to formal topology as well as a predicative justification of this principle.
متن کاملGeneralized Inductive Definitions in Constructive Set Theory
The intent of this paper is to study generalized inductive definitions on the basis of Constructive Zermelo-Fraenkel Set Theory, CZF. In theories such as classical ZermeloFraenkel Set Theory, it can be shown that every inductive definition over a set gives rise to a least and a greatest fixed point, which are sets. This principle, notated GID, can also be deduced from CZF plus the full impredic...
متن کاملPROOF THEORY OF MARTIN - LÖF TYPE THEORY . AN OVERVIEW 1 Anton SETZER
We give an overview over the historic development of proof theory and the main techniques used in ordinal theoretic proof theory. We argue, that in a revised Hilbert’s programme, ordinal theoretic proof theory has to be supplemented by a second step, namely the development of strong equiconsistent constructive theories. Then we show, how, as part of such a programme, the proof theoretic analysi...
متن کاملOn the Constructive Content of Proofs
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice principles. Special emphasis is put on optimizations that allow for the extraction of realistic programs. Our main field of application is infinitary combinatorics. Higman’s Lemma, having an elegan...
متن کاملInduction-recursion and initial algebras
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (generalized) inductive definitions and allows us to define all standard sets of Martin-Löf type theory as well as a large collection of commonly occurring inductive data structures. It also includes a variety of universes which are constructive analogues of inaccessibles and other large cardinals belo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009