The proof-theoretic analysis of transfinitely iterated fixed point theories

, , &
Journal of Symbolic Logic 64 (1):53-67 (1999)
  Copy   BIBTEX

Abstract

This article provides the proof-theoretic analysis of the transfinitely iterated fixed point theories $\widehat{ID}_\alpha and \widehat{ID}_{ the exact proof-theoretic ordinals of these systems are presented

Categories

Keywords

Reprint years

DOI

10.2307/2586750

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,506

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 Proof-Theoretic Analysis of Transfinitely Iterated Quasi Least Fixed Points.Dieter Probst - 2006 - Journal of Symbolic Logic 71 (3):721 - 746.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.
Some theories with positive induction of ordinal strength ϕω.Gerhard Jäger & Thomas Strahm - 1996 - Journal of Symbolic Logic 61 (3):818-842.
About the proof-theoretic ordinals of weak fixed point theories.Gerhard Jäger & Barbara Primo - 1992 - Journal of Symbolic Logic 57 (3):1108-1119.
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.
The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\mu$\end{document} quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. [REVIEW]Markus Marzetta & Thomas Strahm - 1998 - Archive for Mathematical Logic 37 (5-6):391-413.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
Ordinals connected with formal theories for transfinitely iterated inductive definitions.W. Pohlers - 1978 - Journal of Symbolic Logic 43 (2):161-182.

Analytics

Added to PP
2009-01-28

Downloads
75 (#303,121)

6 months
15 (#211,778)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Reinhard Kahle
University Tübingen

Citations of this work

Classes and truths in set theory.Kentaro Fujimoto - 2012 - Annals of Pure and Applied Logic 163 (11):1484-1523.
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.

View all 21 citations / Add more citations

References found in this work

Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Zeitshrift für Mathematische Logik Und Grundlagen der Mathematik 35 (1):97--130.
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Mathematical Logic Quarterly 35 (2):97-130.

Add more references