The strength of countable saturation
Logic
2016-05-20 v2
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.
Keywords
Cite
@article{arxiv.1605.02534,
title = {The strength of countable saturation},
author = {B. van den Berg and E. M. Briseid and P. Safarik},
journal= {arXiv preprint arXiv:1605.02534},
year = {2016}
}
Comments
Corrected typos in Lemma 3.4 and the final paragraph of the conclusion