Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T13:32:42.349Z Has data issue: false hasContentIssue false

Wellordering proofs for metapredicative Mahlo

Published online by Cambridge University Press:  12 March 2014

Thomas Strahm*
Affiliation:
Universität Bern, Institut für Informatik und Angewandte Mathematik, Neubrückstrasse 10, CH-3012 Bern, Switzerland, E-mail: strahm@iam.unibe.ch

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable