Abstract:
The paper contains proof--theoretic investigations on extensions of Kripke--Platek set theory, KP, which accommodate first order reflection. Ordinal analyses for such theories are obtained by devising cut elimination procedures for infinitary calculi of ramified set theory with \Pi n reflection rules. This leads to consistency proofs for the theories KP + \Pi n--reflection using a small amount of arithmetic (PRA) and the well--foundedness of a certain ordinal notation system with respect to primitive recursive descending sequences. Regarding future work, we intend to avail ourselves of these new cut elimination techniques to attain an ordinal analysis of \Pi 1 2 comprehension by approaching \Pi
Citations
|
266
|
1984] Intuitionistic Type Theory
– Martin-Löf
|
|
132
|
Admissible Sets and Structures
– Barwise
- 1975
|
|
71
|
Proof Theory
– Schutte
- 1977
|
|
55
|
Proof theory: Some applications of cut-elimination
– Schwichtenberg
- 1977
|
|
46
|
Iterated Inductive Definitions and Subsystems of Analysis
– Buchholz, Feferman, et al.
- 1981
|
|
37
|
Recursion-Theoretic Hierarchies
– Hinman
- 1978
|
|
35
|
Proof Theory: An Introduction
– Pohlers
- 1989
|
|
26
|
Proof Theory of Impredicative Subsystems of Analysis. Bibliopolis
– Buchholz, Schutte
- 1988
|
|
26
|
Theories for Admissible Sets: A Unifying Approach to Proof Theory. Bibliopolis
– Jager
- 1986
|
|
24
|
Eine beweistheoretische Untersuchung von \Delta 2 -- CA+ BI und verwandter Systeme, Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch--Naturwissenschaftliche Klasse
– Jager, Pohlers
- 1982
|
|
16
|
A simplified version of local predicativity
– BUCHHOLZ
- 1990
|
|
11
|
Proof-theoretic equivalences between classical and constructive theories for analysis
– Feferman, Sieg
- 1981
|
|
11
|
Elementary descent recursion and proof theory
– Friedman, Sheard
- 1995
|
|
11
|
Ordinal notations based on a weakly Mahlo cardinal
– Rathjen
- 1990
|
|
10
|
How to develop proof--theoretic ordinal functions on the basis of admissible sets
– Rathjen
- 1993
|
|
9
|
Systems of predicative analysis II: representations of ordinals
– Feferman
- 1968
|
|
9
|
Proof theory and ordinal analysis
– Pohlers
- 1991
|
|
9
|
Collapsing functions based on recursively large ordinals: A well--ordering proof for KPM. Archive for Mathematical Logic 33
– Rathjen
- 1994
|
|
8
|
Eine beweistheoretische Untersuchung von (\Delta 2 -CA)+ (BI) und verwandter Systeme
– ager, G, et al.
- 1982
|
|
7
|
Contributions of the Schutte school in Munich to proof theory", Appendix to Takeuti
– POHLERS
- 1987
|
|
7
|
Consistency proofs of subsystems of classical analysis
– Takeuti
- 1967
|
|
5
|
Proof Theory
– POHLERS
- 1989
|
|
4
|
Proof Theory (second edition
– TAKEUTI
- 1987
|
|
3
|
1990]An intuitionistic theory of transfinite types, preliminary draft
– PALMGREN
- 1990
|
|
3
|
Proof theory and set theory, Synthese 62
– TAKEUTI
- 1985
|
|
3
|
Theories for Admissible Sets: A Unifying Approach to Proof Theory
– AGER
- 1986
|
|
2
|
1991a], Proof--theoretic analysis of
– RATHJEN
|
|
2
|
1991b], An interpretation of KPM in second order arithmetic and a characterization of 1--section (superjump
– RATHJEN
|
|
1
|
und RICHTER W.H. [1974], Inductive definitions and reflecting properties of admissible ordinals
– ACZEL
|
|
1
|
order arithmetic and related topics, Annals 15 This holds even for elementary functions
– APT, MAREK
|
|
1
|
1993] Zur Beweistheorie von KP + Π3–Ref, type–written manuscript
– SCHÜTTE
|
|
1
|
order arithmetic and related topics, Annals This holds even for elementary functions
– APT, MAREK
|
|
