The strength of admissibility without foundation

DOI10.2307/2274140zbMath0585.03032OpenAlexW2050939025MaRDI QIDQ3710526

Gerhard Jäger

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274140

zbMATH Keywords

proof theoryproof-theoretic ordinalsubsystems of set theorytheories for iterated admissible sets

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Wellordering proofs for metapredicative Mahlo ⋮ Levels of truth ⋮ Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees ⋮ The Operational Perspective: Three Routes ⋮ On the relationship between fixed points and iteration in admissible set theory without foundation ⋮ Universes in explicit mathematics ⋮ Generalizations of the one-dimensional version of the Kruskal-Friedman theorems ⋮ Reflections on reflections in explicit mathematics ⋮ Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$ ⋮ Universes over Frege structures

Cites Work

• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Beweistheorie vonKPN
• A well-ordering proof for Feferman's theoryT 0
• Systems of predicative analysis