Wellordering Proofs for Metapredicative Mahlo

In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the underlying universe of discourse. In particular, it is shown that in the corresponding theories EMA of explicit mathematics and KPm0 of admissible set theory, transfinite induction along initial segments of the ordinal 00, for being a ternary Veblen function, is derivable. This reveals that the upper bounds given for these two systems in the paper J

• Type: Journal
• Year: 2002
• Where: JSYML
• Authors: Thomas Strahm
• Keywords: Admissible Set, Corresponding Theories Ema, Explicit Mathematics, JSYML 2002