The strength of countable saturation
| Autor: | Berg, B. van den, Briseid, E. M., Safarik, P. |
|---|---|
| Rok vydání: | 2016 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: Corrected typos in Lemma 3.4 and the final paragraph of the conclusion |
| Databáze: | arXiv |
| Externí odkaz: |
|