June 25, 2024Open Access

Games with backtracking options corresponding to the ordinal analysis of PA

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We give another proof of ordinal analysis of I₊-fragments of Peano Arithmetic which is free from cut-elimination of -logic. Our main tool is a direct witnessing argument utilizing game notion, motivated from the realm of proof complexity and bounded arithmetic.

Leer artículo completoexternamente

Me gusta

Guardar

Ver artículo completo

Cite This Study

Eitetsu Ken (Tue,) studied this question.

synapsesocial.com/papers/68e636c5b6db6435875c8aca https://doi.org/https://doi.org/10.48550/arxiv.2406.17315

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Witnessing flows in arithmetic2024
2Witnessing Flows in Arithmetic2024
3Indiscernibles and satisfaction classes in arithmetic2024
4Proofs that Modify Proofs2024
5Y <scp>udai</scp> S <scp>uzuki</scp> . <i> <b>Studies on Partial Impredicativity in Formal Systems of Arithmetic and Computability Theory</b> </i> . Tohoku University. 6-3, Aza-Aoba, Aramaki, Aoba-ku, Sndai, Miyagi, Japan. 2024. Supervised by Keita Yokoyama. MSC: 03F35, 03D30. Keywords: reverse mathematics, Weihrauch degrees, predicativity2025

Me gusta

Guardar

Ver artículo completo