scientific article
From MaRDI portal
Publication:3138834
zbMath0791.03031MaRDI QIDQ3138834
Publication date: 7 July 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kripke-Platek set theoryordinal notationscut-eliminationadmissible set theoryfoundation axiomproof-theoretic ordinalsinfinitary proof rulesfoundation schemeprovably set recursive functions
Cut-elimination and normal-form theorems (03F05) Axiomatics of classical set theory and its fragments (03E30) Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Relative consistency and interpretations (03F25)
Related Items
Simplified Cut Elimination for Kripke-Platek Set Theory, Operational closure and stability, Relativized ordinal analysis: the case of power Kripke-Platek set theory, A few more dissimilarities between second-order arithmetic and set theory, From the weak to the strong existence property, Classes and truths in set theory, On Feferman's operational set theory \textsf{OST}, Proof-theoretic investigations on Kruskal's theorem, \(\Pi_1^1\)-comprehension as a well-ordering principle, Theories and ordinals in proof theory, The strength of extensionality. I: Weak weak set theories with infinity, Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
