100 citations · 264 across the 34 of their papers we have counts for
1 paper · 1 filter
Alberto Marcone, Antonio Montalbán
We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a we…