Gradualist descriptionalist set theory

Abstract

We introduce a formal language GDST (gradualist descriptionalist set theory) with a family of interpretations indexed by ordinals, as well as a sublanguage NMID (the language of not necessarily monotonic inductive definitions), and show that the assertion that all propositions in NMID have well-defined truth values is equivalent to the existence for each $k \in \mathbb N$ of a sequence of ordinals $\eta_0 < . . . < \eta_k$ such that for each $i < k$, $\eta_i$ is $\eta_{i+1}$-reflecting, a notion we introduce which implies being $\Pi_n$-reflecting for all $n \in \mathbb N$ (and in particular being admissible and recursively Mahlo).