The strength of countable saturation

2016/05/09 by Benno van den Berg, Berg, B. van den, Eyvind Martol Briseid +3
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.1605.02534

openalex publication_date 2016/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Reverse Mathematics and parameter-free Transfer

Related

• Expansions, omitting types, and standard systems
• A functional interpretation for nonstandard arithmetic
• Undefinability and Absolute Undefinability in Arithmetic
• Lofty Models of Peano Arithmetic
• Exact saturation in pseudo-elementary classes for simple and stable theories