Mathematical Logic Quarterly 47 (3):363-396 (2001)

Abstract
By combining the methods of two former papers of ours we develop a finitary ordinal analysis of the axiom system KPi of Kripke-P atek set theory with an inaccessible universe. As a main result we obtain an upper bound for the provably recursive functions of KPi.
Keywords Ordina analysis  Provably recursive functions  Proof theory  Cut‐elimination
Categories (categorize this paper)
DOI 10.1002/1521-3870(200108)47:3<363::AID-MALQ363>3.0.CO;2-P
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,304
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-03

Total views
17 ( #557,963 of 2,330,100 )

Recent downloads (6 months)
1 ( #583,587 of 2,330,100 )

How can I increase my downloads?

Downloads

My notes