The strength of countable saturation

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.

arXiv commentCorrected typos in Lemma 3.4 and the final paragraph of the conclusion

References in corpus (1)

• Reverse Mathematics and parameter-free Transfer