The strength of countable saturation
B. van den Berg, E.M. Briseid, P. Safarik
TL;DR
This paper assesses the proof-theoretic strength of the principle of countable saturation within systems for nonstandard arithmetic, providing insights into its foundational implications.
Contribution
It precisely characterizes the proof-theoretic strength of countable saturation in nonstandard arithmetic systems, advancing understanding of their foundational properties.
Findings
Countable saturation's proof-theoretic strength is explicitly determined.
The results clarify the role of countable saturation in nonstandard arithmetic.
The work connects countable saturation to existing proof-theoretic frameworks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Computability, Logic, AI Algorithms · Advanced Topology and Set Theory