Inaccessible set axioms may have little consistency strength

Annals of Pure and Applied Logic 115 (1-3):33-70 (2002)
  Copy   BIBTEX

Abstract

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depend on the context in which they are embedded. The context here will be the theory CZF− of constructive Zermelo–Fraenkel set theory but without -Induction . Let INAC be the statement that for every set there is an inaccessible set containing it. CZF−+INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF−+INAC also has a realizability interpretation in type theory which gives its theorems a direct computational meaning. The main result presented here is that the proof theoretic ordinal of CZF−+INAC is a small ordinal known as the Feferman–Schütte ordinal Γ0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The consistency strength of an infinitary Ramsey property.George Kafkoulis - 1994 - Journal of Symbolic Logic 59 (4):1158-1195.
On the axiom of union.Greg Oman - 2010 - Archive for Mathematical Logic 49 (3):283-289.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Proper forcing extensions and Solovay models.Joan Bagaria & Roger Bosch - 2004 - Archive for Mathematical Logic 43 (6):739-750.
Localizing the axioms.Athanassios Tzouvaras - 2010 - Archive for Mathematical Logic 49 (5):571-601.
Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
Stretchings.O. Finkel & J. P. Ressayre - 1996 - Journal of Symbolic Logic 61 (2):563-585.
Consistency strength of higher chang’s conjecture, without CH.Sean D. Cox - 2011 - Archive for Mathematical Logic 50 (7-8):759-775.
On the Consistency Strength of Two Choiceless Cardinal Patterns.Arthur W. Apter - 1999 - Notre Dame Journal of Formal Logic 40 (3):341-345.

Analytics

Added to PP
2014-01-16

Downloads
51 (#297,770)

6 months
8 (#283,518)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Laura Crosilla
University of Oslo
Moritz Rathjen
Albert Ludwigs Universität Freiburg

Citations of this work

Predicativism as a Form of Potentialism.Øystein Linnebo & Stewart Shapiro - 2023 - Review of Symbolic Logic 16 (1):1-32.
Maddy On The Multiverse.Claudio Ternullo - 2019 - In Deniz Sarikaya, Deborah Kant & Stefania Centrone (eds.), Reflections on the Foundations of Mathematics. Berlin: Springer Verlag. pp. 43-78.
Set theory: Constructive and intuitionistic ZF.Laura Crosilla - 2010 - Stanford Encyclopedia of Philosophy.
Quotient topologies in constructive set theory and type theory.Hajime Ishihara & Erik Palmgren - 2006 - Annals of Pure and Applied Logic 141 (1):257-265.

View all 7 citations / Add more citations

References found in this work

Constructive set theory.John Myhill - 1975 - Journal of Symbolic Logic 40 (3):347-382.
The strength of some Martin-Löf type theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.

View all 7 references / Add more references