The strength of admissibility without foundation
From MaRDI portal
Publication:3710526
DOI10.2307/2274140zbMath0585.03032MaRDI QIDQ3710526
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
proof theory; proof-theoretic ordinal; subsystems of set theory; theories for iterated admissible sets
03F05: Cut-elimination and normal-form theorems
03F35: Second- and higher-order arithmetic and fragments
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Wellordering proofs for metapredicative Mahlo, Universes in explicit mathematics, Generalizations of the one-dimensional version of the Kruskal-Friedman theorems, Universes over Frege structures, Levels of truth, On the relationship between fixed points and iteration in admissible set theory without foundation, Reflections on reflections in explicit mathematics, Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
Cites Work