Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Barwise (1975)
Admissible sets and structures
W.H. Richter (1971)
Logic Colloquium '69
W. Buchholz (1986)
A new system of proof-theoretic ordinal functionsArch. Math. Logik Grundlagenforsch., 32
C. Smorynski (1977)
Handbook of mathematical logic
Stephen Simpson (1985)
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher BäumeArchiv für mathematische Logik und Grundlagenforschung, 25
Gerhard Jäger (1986)
Theories for admissible sets : a unifying approach to proof theory
W. Pohlers (1991)
Proof theory and ordinal analysisArchive for Mathematical Logic, 30
C. Smorynski (1977)
The Incompleteness TheoremsStudies in logic and the foundations of mathematics, 90
L. Harrington (1974)
The Superjump and the First Recursively Mahlo OrdinalStudies in logic and the foundations of mathematics, 79
W. Buchholz (1984)
Ein Mengensystem ohne Kollabierungsfunktionen
W. Buchholz (1986)
A new system of proof-theoretic ordinal functionsAnn. Pure Appl. Log., 32
W. Pohlers (1987)
Ordinal notations based on a hierarchy of inaccessible cardinalsAnn. Pure Appl. Log., 33
Wayne Richter (1971)
Recursively Mahlo Ordinals and Inductive DefinitionsStudies in logic and the foundations of mathematics, 61
K. Schütte (1977)
Proof theory
W. Pohlers (1990)
Proof Theory: An Introduction
W. Buchholz, K. Schütte (1988)
Proof Theory of Impredicative Subsystems of Analysis
Gerhard Jäger (1984)
ϱ-inaccessible ordinals, collapsing functions and a recursive notation systemArchiv für mathematische Logik und Grundlagenforschung, 24
M. Rathjen (1990)
Ordinal notations based on a weakly Mahlo cardinalArchive for Mathematical Logic, 29
KPM is a subsystem of set theory designed to formalize a recursively Mahlo universe of sets. In this paper we show that a certain ordinal notation system is sufficient to measure the proof-theoretic strength ofKPM. This involves a detour through an infinitary calculus RS(M), for which we prove several cutelimination theorems. Full cut-elimination is available for derivations of $$\Sigma (L_{\omega _1^c } )$$ sentences, whereω 1 c denotes the least nonrecursive ordinal. This paper is self-contained, at least from a technical point of view.
Archive for Mathematical Logic – Springer Journals
Published: Apr 19, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.