Journal of Symbolic Logic

The Veblen functions for computability theorists

Alberto Marcone and Antonio Montalbán

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) “If 𝒳 is a well-ordering, then so is ε𝒳”, and (2) “If 𝒳 is a well-ordering, then so is φ(α,𝒳)”, where α is a fixed computable ordinal and φ represents the two-placed Veblen function. For the former statement, we show that ω iterations of the Turing jump are necessary in the proof and that the statement is equivalent to ACA₀⁺ over RCA₀. To prove the latter statement we need to use ωα iterations of the Turing jump, and we show that the statement is equivalent to Π⁰ωα-CA₀. Our proofs are purely computability-theoretic. We also give a new proof of a result of Friedman: the statement “if 𝒳 is a well-ordering, then so is φ(𝒳,0)” is equivalent to ATR₀ over RCA₀.

Article information

J. Symbolic Logic, Volume 76, Issue 2 (2011), 575-602.

First available in Project Euclid: 19 May 2011

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Marcone, Alberto; Montalbán, Antonio. The Veblen functions for computability theorists. J. Symbolic Logic 76 (2011), no. 2, 575--602. doi:10.2178/jsl/1305810765.

Export citation