New uniqueness and finite dependent-choice axioms are placed inside hyperarithmetic analysis, and the class RFN^{-1}(ATR0) is shown to approximate hyperarithmetic analysis by closure properties and instance restrictions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximation of hyperarithmetic analysis by $\omega$-model reflection
New uniqueness and finite dependent-choice axioms are placed inside hyperarithmetic analysis, and the class RFN^{-1}(ATR0) is shown to approximate hyperarithmetic analysis by closure properties and instance restrictions.