Universes in metapredicative analysis

Archive for Mathematical Logic 42 (2):129-151 (2003)
  Copy   BIBTEX

Abstract

In this paper we introduce theories of universes in analysis. We discuss a non-uniform, a uniform and a minimal variant. An analysis of the proof-theoretic bounds of these systems is given, using only methods of predicative proof-theory. It turns out that all introduced theories are of proof-theoretic strength between Γ0 and ϕ1ɛ00

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-002-0149-8

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

The [mathematical formula] quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.Markus Marzetta & Thomas Strahm - 1997 - Archive for Mathematical Logic 36 (6):391-413.
Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.
The strength of Martin-Löf type theory with a superuniverse. Part II.Michael Rathjen - 2001 - Archive for Mathematical Logic 40 (3):207-233.
The proof-theoretic analysis of transfinitely iterated fixed point theories.Gerhard JÄger, Reinhard Kahle, Anton Setzer & Thomas Strahm - 1999 - Journal of Symbolic Logic 64 (1):53-67.
The strength of Martin-Löf type theory with a superuniverse. Part I.Michael Rathjen - 2000 - Archive for Mathematical Logic 39 (1):1-39.
The model-theoretic ordinal analysis of theories of predicative strength.Jeremy Avigad & Richard Sommer - 1999 - Journal of Symbolic Logic 64 (1):327-349.
Probabilistic arguments for multiple universes.Kai Draper, Paul Draper & Joel Pust - 2007 - Pacific Philosophical Quarterly 88 (3):288–307.
Type-theoretic interpretation of iterated, strictly positive inductive definitions.Erik Palmgren - 1992 - Archive for Mathematical Logic 32 (2):75-99.
An ordinal analysis for theories of self-referential truth.Graham Emil Leigh & Michael Rathjen - 2010 - Archive for Mathematical Logic 49 (2):213-247.
Island Universes and the Analysis of Modality.Phillip Bricker - 2001 - In Gerhard Preyer & Frank Siebelt (eds.), Reality and Humean Supervenience: Essays on the Philosophy of David Lewis. Rowman & Littlefield Publishers.
A proof of strongly uniform termination for Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} by methods from local predicativity. [REVIEW]Andreas Weiermann - 1997 - Archive for Mathematical Logic 36 (6):445-460.
The proof-theoretic analysis of Σ11 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1-3):195-234.

Analytics

Added to PP
2013-11-23

Downloads
9 (#1,219,856)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

View all 8 references / Add more references