The strength of countable saturation [article]

B. van den Berg and E.M. Briseid and P. Safarik
<span title="2016-05-19">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1605.02534v2</a> <a target="_blank" rel="external noopener" href="">fatcat:wr4chbeb5nayrd2rseyngesg4m</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>