Realizability for Peano arithmetic with winning conditions in HON games

Annals of Pure and Applied Logic 168 (2):254-277 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.10.006

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

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

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.
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness.Federico Aschieri - 2013 - Annals of Pure and Applied Logic 164 (6):591-617.
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.
Models of arithmetic and categories with finiteness conditions.R. Diaconescu & L. A. S. Kirby - 1987 - Annals of Pure and Applied Logic 35 (C):123-148.
Inductive definitions over a predicative arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.
Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.
Generalized extensional realizability.L. Gordeev - 1988 - Annals of Pure and Applied Logic 38 (1):106.

Analytics

Added to PP
2016-10-18

Downloads
33 (#500,331)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.

Add more citations

References found in this work

A semantics of evidence for classical arithmetic.Thierry Coquand - 1995 - Journal of Symbolic Logic 60 (1):325-337.
Realizability.A. S. Troelstra - 2000 - Bulletin of Symbolic Logic 6 (4):470-471.
Typed lambda-calculus in classical Zermelo-Frænkel set theory.Jean-Louis Krivine - 2001 - Archive for Mathematical Logic 40 (3):189-205.
Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.

View all 7 references / Add more references