Results 1 
8 of
8
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's numbers whi ..."
Abstract

Cited by 16 (4 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...
The Mathematical Development Of Set Theory  From Cantor To Cohen
 The Bulletin of Symbolic Logic
, 1996
"... This article is dedicated to Professor Burton Dreben on his coming of age. I owe him particular thanks for his careful reading and numerous suggestions for improvement. My thanks go also to Jose Ruiz and the referee for their helpful comments. Parts of this account were given at the 1995 summer meet ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
This article is dedicated to Professor Burton Dreben on his coming of age. I owe him particular thanks for his careful reading and numerous suggestions for improvement. My thanks go also to Jose Ruiz and the referee for their helpful comments. Parts of this account were given at the 1995 summer meeting of the Association for Symbolic Logic at Haifa, in the Massachusetts Institute of Technology logic seminar, and to the Paris Logic Group. The author would like to express his thanks to the various organizers, as well as his gratitude to the Hebrew University of Jerusalem for its hospitality during the preparation of this article in the autumn of 1995.
Metapredicative And Explicit Mahlo: A ProofTheoretic Perspective
"... After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the
Interpreting Mahlo set theory in Mahlo type theory
, 1999
"... In this paper it is shown that constructive set theory with an axiom asserting the existence of a Mahlo set can be embedded into Setzer's Mahlo type theory. 1 Mahloness in constructive set theory Definition 1.1 A set M is said to be Mahlo if M is setinaccessible and for every R 2 mv( M M) there ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper it is shown that constructive set theory with an axiom asserting the existence of a Mahlo set can be embedded into Setzer's Mahlo type theory. 1 Mahloness in constructive set theory Definition 1.1 A set M is said to be Mahlo if M is setinaccessible and for every R 2 mv( M M) there exists a setinaccessible I 2 M such that 8x 2 I 9y 2 I hx; yi 2 R: Lemma 1.2 If M is Mahlo and R 2 mv( M M), then for every a 2 M there exists a setinaccessible I 2 M such that a 2 I and 8x 2 I 9y 2 I hx; yi 2 R: Proof : Set S := fhx; ha; yii : hx; yi 2 Rg. Then S 2 mv( M M) too. Hence there exists I 2 M such that 8x 2 I 9y 2 I hx; yi 2 S. Now pick c 2 I. Then hc; di 2 S for some d 2 I. Moreover, d = ha; yi for some y. In particular, a 2 I. Further, for each x 2 I there exists u 2 I such that hx; ui 2 S. As a result, u = ha; yi and hx; yi 2 R for some y. Since u 2 I implies y 2 I, the latter shows that 8x 2 I 9y 2 I hx; yi 2 R. ut Definition 1.3 Let Reg s (A) be the stateme...
The Higher Infinite in Proof Theory
 Logic Colloquium '95. Lecture Notes in Logic
, 1995
"... this paper. The exposition here diverges from the presentation given at the conference in two regards. Firstly, the talk began with a broad introduction, explaining the current rationale and goals of ordinaltheoretic proof theory, which take the place of the original Hilbert Program. Since this par ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
this paper. The exposition here diverges from the presentation given at the conference in two regards. Firstly, the talk began with a broad introduction, explaining the current rationale and goals of ordinaltheoretic proof theory, which take the place of the original Hilbert Program. Since this part of the talk is now incorporated in the first two sections of the BSLpaper [48] there is no point in reproducing it here. Secondly, we shall omit those parts of the talk concerned with infinitary proof systems of ramified set theory as they can also be found in [48] and even more detailed in [45]. Thirdly, thanks to the aforementioned omissions, the advantage of present paper over the talk is to allow for a much more detailed account of the actual information furnished by ordinal analyses and the role of large cardinal hypotheses in devising ordinal representation systems. 2 Observations on ordinal analyses
BERNAYS AND SET THEORY
"... Abstract. We discuss the work of Paul Bernays in set theory, mainly his axiomatization and his use of classes but also his higherorder reflection principles. Paul Isaak Bernays (1888–1977) is an important figure in the development of mathematical logic, being the main bridge between Hilbert and Göd ..."
Abstract
 Add to MetaCart
Abstract. We discuss the work of Paul Bernays in set theory, mainly his axiomatization and his use of classes but also his higherorder reflection principles. Paul Isaak Bernays (1888–1977) is an important figure in the development of mathematical logic, being the main bridge between Hilbert and Gödel in the intermediate generation and making contributions in proof theory, set theory, and the philosophy of mathematics. Bernays is best known for the twovolume 1934,1939 Grundlagen der Mathematik [39, 40], written solely by him though Hilbert was retained as first author. Going into many reprintings and an eventual second edition thirty years later, this monumental work provided a magisterial exposition of the work of the Hilbert school in the formalization of firstorder logic and in proof theory and the work of Gödel on incompleteness and its surround, including the first complete proof of the Second Incompleteness Theorem. 1 Recent reevaluation of Bernays ’ role actually places him at the center of the development of mathematical logic and Hilbert’s program. 2 But starting in his forties, Bernays did his most individuated, distinctive mathematical work in set theory, providing a timely axiomatization and later applying higherorder reflection principles, and produced a stream of