Peano arithmetic, games and descent recursion

Annals of Pure and Applied Logic 176 (4):103550 (2025)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2024.103550

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.
Saturation and simple extensions of models of peano arithmetic.Matt Kaufmann & James H. Schmerl - 1984 - Annals of Pure and Applied Logic 27 (2):109-136.
On the programs-as-formulas interpretation of parallel programs in peano arithmetic.E. J. Farkas & M. E. Szabo - 1988 - Annals of Pure and Applied Logic 37 (2):111-127.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Lipschitz and Wadge binary games in second order arithmetic.Andrés Cordón-Franco, F. Félix Lara-Martín & Manuel J. S. Loureiro - 2023 - Annals of Pure and Applied Logic 174 (9):103301.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
Inductive definitions over a predicative arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics.Balázs Biró & Ildikó Sain - 1993 - Annals of Pure and Applied Logic 63 (3):201-225.

Analytics

Added to PP
2024-12-13

Downloads
5 (#1,754,154)

6 months
5 (#1,056,575)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Notation systems for infinitary derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.
A semantics of evidence for classical arithmetic.Thierry Coquand - 1995 - Journal of Symbolic Logic 60 (1):325-337.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.

View all 6 references / Add more references