Results 1  10
of
11
Inaccessibility in Constructive Set Theory and Type Theory
, 1998
"... This paper is the first in a series whose objective is to study notions of large sets in the context of formal theories of constructivity. The two theories considered are Aczel's constructive set theory (CZF) and MartinLof's intuitionistic theory of types. This paper treats Mahlo&apos ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
This paper is the first in a series whose objective is to study notions of large sets in the context of formal theories of constructivity. The two theories considered are Aczel's constructive set theory (CZF) and MartinLof's intuitionistic theory of types. This paper treats Mahlo's numbers which give rise classically to the enumerations of inaccessibles of all transfinite orders. We extend the axioms of CZF and show that the resulting theory, when augmented by the tertium non datur, is equivalent to ZF plus the assertion that there are inaccessibles of all transfinite orders. Finally the theorems of that extension of CZF are interpreted in an extension of MartinLof's intuitionistic theory of types by a universe. 1 Prefatory and historical remarks The paper is organized as follows: After recalling Mahlo's numbers and relating the history of universes in MartinLof type theory in section 1, we study notions of inaccessibility in the context of Aczel's constructive set theo...
Realizability for constructive ZermeloFraenkel set theory
 STOLTENBERGHANSEN (EDS.): PROCEEDINGS OF THE LOGIC COLLOQUIUM 2003
, 2004
"... Constructive ZermeloFraenkel Set Theory, CZF, has emerged as a standard reference theory that relates to constructive predicative mathematics as ZFC relates to classical Cantorian mathematics. A hallmark of this theory is that it possesses a typetheoretic model. Aczel showed that it has a formulae ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
Constructive ZermeloFraenkel Set Theory, CZF, has emerged as a standard reference theory that relates to constructive predicative mathematics as ZFC relates to classical Cantorian mathematics. A hallmark of this theory is that it possesses a typetheoretic model. Aczel showed that it has a formulaeastypes interpretation in MartinLöf’s intuitionist theory of types [14, 15]. This paper, though, is concerned with a rather different interpretation. It is shown that Kleene realizability provides a selfvalidating semantics for CZF, viz. this notion of realizability can be formalized in CZF and demonstrably in CZF it can be verified that every theorem of CZF is realized. This semantics, then, is put to use in establishing several equiconsistency results. Specifically, augmenting CZF by wellknown principles germane to Russian constructivism and Brouwer’s intuitionism turns out to engender theories of equal prooftheoretic strength with the same stock of provably recursive functions.
The strength of MartinLöf type theory with a superuniverse. Part II
 PART I. ARCHIVE FOR MATHEMATICAL LOGIC 39, ISSUE
, 2000
"... Universes of types were introduced into constructive type theory by MartinLof [3]. The idea of forming universes in type theory is to introduce a universe as a set closed under a certain specified ensemble of set constructors, say C. The universe then "reflects" C. This is the second par ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
Universes of types were introduced into constructive type theory by MartinLof [3]. The idea of forming universes in type theory is to introduce a universe as a set closed under a certain specified ensemble of set constructors, say C. The universe then "reflects" C. This is the second part of a paper which addresses the exact logical strength of a particular such universe construction, the socalled superuniverse due to Palmgren (cf. [4, 5, 6]). It is proved that MartinLof type theory with a superuniverse, termed MLS, is a system whose prooftheoretic ordinal resides strictly above the FefermanSchutte ordinal \Gamma 0 but well below the BachmannHoward ordinal. Not many theories of strength between \Gamma 0 and the BachmannHoward ordinal have arisen. MLS provides a natural example for such a theory. In this second part of the paper the concern is with the with upper bounds.
Choice principles in constructive and classical set theories
 POHLERS (EDS.): PROCEEDINGS OF THE LOGIC COLLOQUIUM 2002
, 2002
"... The objective of this paper is to assay several forms of the axiom of choice that have been deemed constructive. In addition to their deductive relationships, the paper will be concerned with metamathematical properties effected by these choice principles and also with some of their classical models ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
The objective of this paper is to assay several forms of the axiom of choice that have been deemed constructive. In addition to their deductive relationships, the paper will be concerned with metamathematical properties effected by these choice principles and also with some of their classical models.
On the Constructive Dedekind Reals
 Log. Anal
, 2008
"... In order to build the collection of Cauchy reals as a set in constructive set theory, the only Power Setlike principle needed is Exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than that. The main purpose here is to show that Exponentiation alon ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In order to build the collection of Cauchy reals as a set in constructive set theory, the only Power Setlike principle needed is Exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than that. The main purpose here is to show that Exponentiation alone does not suffice for the latter, by furnishing a Kripke model of constructive set theory, CZF with Subset Collection replaced by Exponentiation, in which the Cauchy reals form a set while the Dedekind reals constitute a proper class. 1
1 Nondeterminism in Formal Development of Concurrent Programs: A Constructive Approach
"... Abstract. It is now widely accepted that programming concurrent software is a complex, errorprone task. Therefore it is useful to specify, develop, and verify concurrent programs using formal methods. In our continuing work, we try to develop a constructive framework for extracting concurrent pro ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. It is now widely accepted that programming concurrent software is a complex, errorprone task. Therefore it is useful to specify, develop, and verify concurrent programs using formal methods. In our continuing work, we try to develop a constructive framework for extracting concurrent programs from their formal specifications. In this framework, we use CZ specification language and rely on a translation of CZ set theory into MartinLöf's theory of types. In this paper, we introduce the first part of our work in which we regard and track the nondeterminism involved in CZ formal specifications of concurrent programs. Key words: concurrency, constructivism, formal program development, nondeterminism in CZ language, nondeterminism in MartinLöf's theory of types
Normalization by Evaluation for MartinL"of Type Theory with One Universe
"... Replace this file with prentcsmacro.sty for your meeting,or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. ..."
Abstract
 Add to MetaCart
(Show Context)
Replace this file with prentcsmacro.sty for your meeting,or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page.
unknown title
"... An intuitionistic theory of types with assumptions of higharity variables ..."
Abstract
 Add to MetaCart
An intuitionistic theory of types with assumptions of higharity variables