An intuitionistic version of Ramsey's Theorem and its use in Program Termination

&
Annals of Pure and Applied Logic 166 (12):1382-1406 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.08.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

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

The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.
An Intuitionistic Version of Cantor's Theorem.Dario Maguolo & Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):446-448.
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.
Ramsey’s theorem for trees: the polarized tree theorem and notions of stability. [REVIEW]Damir D. Dzhafarov, Jeffry L. Hirst & Tamara J. Lakins - 2010 - Archive for Mathematical Logic 49 (3):399-415.
Reverse mathematics and Ramsey's property for trees.Jared Corduan, Marcia J. Groszek & Joseph R. Mileti - 2010 - Journal of Symbolic Logic 75 (3):945-954.
Interpolation theorems for intuitionistic predicate logic.G. Mints - 2001 - Annals of Pure and Applied Logic 113 (1-3):225-242.
Combinatorial Unprovability Proofs and Their Model-Theoretic Counterparts.Mojtaba Aghaei & Amir Khamseh - 2014 - Notre Dame Journal of Formal Logic 55 (2):231-244.
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
A general theorem on termination of rewriting.Jeremy E. Dawson - unknown
Equivalents of the (weak) fan theorem.Iris Loeb - 2005 - Annals of Pure and Applied Logic 132 (1):51-66.
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
Enormous integers in real life.Harvey Friedman - manuscript

Analytics

Added to PP
2015-08-28

Downloads
21 (#754,589)

6 months
6 (#572,748)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stefano Berardi
Università degli Studi di Torino

Citations of this work

Reverse mathematical bounds for the Termination Theorem.Silvia Steila & Keita Yokoyama - 2016 - Annals of Pure and Applied Logic 167 (12):1213-1241.

Add more citations

References found in this work

Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
About Brouwer's fan theorem.Thierry Coquand - 2004 - Revue Internationale de Philosophie 230:483-489.

Add more references