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: 91,164

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

A constructive analysis of learning in Peano Arithmetic.Federico Aschieri - 2012 - Annals of Pure and Applied Logic 163 (11):1448-1470.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Message Exchange Games in Strategic Contexts.Nicholas Asher, Soumya Paul & Antoine Venant - 2017 - Journal of Philosophical Logic 46 (4):355-404.
Model-theoretic properties characterizing peano arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
Gurevich-Harrington's games defined by finite automata.Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 62 (3):265-294.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Expanding the additive reduct of a model of Peano arithmetic.Masahiko Murakami & Akito Tsuboi - 2003 - Mathematical Logic Quarterly 49 (4):363-368.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Extensional realizability.Jaap van Oosten - 1997 - Annals of Pure and Applied Logic 84 (3):317-349.
Why Axiomatize Arithmetic?Charles Sayward - 2005 - Sorites 16:54-61.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.

Analytics

Added to PP
2016-10-18

Downloads
31 (#484,163)

6 months
3 (#857,336)

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