The strength of countable saturation

B. van den Berg, E. M. Briseid, P. Safarik

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.