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}_{<\alpha};$ the exact proof-theoretic ordinals of these systems are presented.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

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.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.

Analytics

Added to PP
2017-02-21

Downloads
7 (#1,413,139)

6 months
1 (#1,516,603)

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.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
Truth in applicative theories.Reinhard Kahle - 2001 - Studia Logica 68 (1):103-128.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references