Wellordering proofs for metapredicative Mahlo

DOI
Publisher DOI
Abstract
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äger and Strahm [11] are indeed sharp.
Date Issued
2002
Publication Type
Article
Subject(s)
Language(s)
en
Author(s)
Additional Credits
Journal
The journal of symbolic logic
Publisher
Cambridge University Press
ISSN
0022-4812
Access(Rights)
open.access
Show full item