A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
Riccardo Bruni · The Review of Symbolic Logic · 2009
This paper introduces theories for arithmeticalquasi-inductive definitions(Burgess, 1986) as it has been done for first-order monotone and nonmonotone inductive ones. After displaying the basic axiomatic framework, we provide some initial result in the proof theoretic bounds line of research (the upper one being given in terms of a theory of sets extending Kripke–Platek set theory).