The strength of countable saturation
arXiv:1605.02534
Abstract
We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.
Corrected typos in Lemma 3.4 and the final paragraph of the conclusion