Let N = empty set + adjunction. N interprets Q.1 Q + induction yields PA.
Does N + epsilon-induction interpret PA? If so:
Are they mutually interpretable, sententially equivalent, and/or bi-interpretable?
Is there an even simpler X such that N + X interprets PA?
If not: Is there a simple X such that N + X interprets PA?
I leave the notion of "simple" deliberately vague, intending it as some kind of conceptual simplicity. (ZFfin and PA are bi-interpretable, but I seek something simpler than ZFfin.)
- A minimal predicative set theory. Antonella Mancini, Franco Montagna. Notre Dame Journal of Formal Logic. 35 (2): 186–203. Spring 1994.