The Veblen functions for computability theorists


We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) “If X is a well-ordering, then so is εX ”, and (2) “If X is a well-ordering, then so is φ(α,X )”, where α is a fixed computable ordinal and φ represents the two-placed Veblen function. For the former statement, we show that ω iterations of the… (More)


2 Figures and Tables

Cite this paper

@article{Marcone2011TheVF, title={The Veblen functions for computability theorists}, author={Alberto Marcone and Antonio Montalb{\'a}n}, journal={J. Symb. Log.}, year={2011}, volume={76}, pages={575-602} }