Set-theoretic reflection is equivalent to induction over well-founded classes

Abstract

We show that induction over $\Delta (\mathbb{R})$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The equivalence is proved in primitive recursive set theory (which is weaker than Kripke-Platek set theory) extended by the axiom of dependent choice.

References in corpus (1)

• ${\Pi }_1^1$-Comprehension as a Well-Ordering Principle