Reverse mathematical bounds for the Termination Theorem
Annals of Pure and Applied Logic 167 (12):1213-1241 (2016)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The Dirac delta function in two settings of Reverse Mathematics.Sam Sanders & Keita Yokoyama - 2012 - Archive for Mathematical Logic 51 (1-2):99-121.
Non-standard analysis in ACA0 and Riemann mapping theorem.Keita Yokoyama - 2007 - Mathematical Logic Quarterly 53 (2):132-146.
The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic.Nobuyuki Sakamoto & Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (5-6):465-480.
On the strength of Ramsey's theorem without Σ1 -induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
Partial impredicativity in reverse mathematics.Henry Towsner - 2013 - Journal of Symbolic Logic 78 (2):459-488.
Reverse mathematics of prime factorization of ordinals.Jeffry L. Hirst - 1999 - Archive for Mathematical Logic 38 (3):195-201.
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.
An intuitionistic version of Ramsey's Theorem and its use in Program Termination.Stefano Berardi & Silvia Steila - 2015 - Annals of Pure and Applied Logic 166 (12):1382-1406.
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, computability, and partitions of trees.Jennifer Chubb, Jeffry L. Hirst & Timothy H. McNicholl - 2009 - Journal of Symbolic Logic 74 (1):201-215.
The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.
A Reverse Analysis of the Sylvester-Gallai Theorem.Victor Pambuccian - 2009 - Notre Dame Journal of Formal Logic 50 (3):245-260.
Menger’s theorem in $${{\Pi^11\tt{-CA}0}}$$.Paul Shafer - 2012 - Archive for Mathematical Logic 51 (3-4):407-423.
Uniform bounds for the Iitaka fibration.Gabriele Di Cerbo - 2014 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 13 (4):1133-1143.
Analytics
Added to PP
2016-06-30
Downloads
16 (#669,501)
6 months
1 (#449,844)
2016-06-30
Downloads
16 (#669,501)
6 months
1 (#449,844)
Historical graph of downloads
Citations of this work
Dickson’s lemma and weak Ramsey theory.Yasuhiko Omata & Florian Pelupessy - 2019 - Archive for Mathematical Logic 58 (3-4):413-425.
References found in this work
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.
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.
