- Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$ Σ 2 0 -induction and the Pigeonhole principle for trees. [REVIEW]Daniele Tavernelli & Lorenzo Carlucci - 2022 - Archive for Mathematical Logic 61 (5-6):827-839.details
|
|
How Strong is Ramsey’s Theorem If Infinity Can Be Weak?Leszek Aleksander Kołodziejczyk, Katarzyna W. Kowalik & Keita Yokoyama - 2023 - Journal of Symbolic Logic 88 (2):620-639.details
|
|
The weakness of the pigeonhole principle under hyperarithmetical reductions.Benoit Monin & Ludovic Patey - 2020 - Journal of Mathematical Logic 21 (3):2150013.details
|
|
Nonstandard models in recursion theory and reverse mathematics.C. T. Chong, Wei Li & Yue Yang - 2014 - Bulletin of Symbolic Logic 20 (2):170-200.details
|
|
Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.details
|
|
Regressive versions of Hindman’s theorem.Lorenzo Carlucci & Leonardo Mainardi - 2024 - Archive for Mathematical Logic 63 (3):447-472.details
|
|
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$ Σ 2 0 -induction and the Pigeonhole principle for trees. [REVIEW]Lorenzo Carlucci & Daniele Tavernelli - 2022 - Archive for Mathematical Logic 61 (5):827-839.details
|
|
Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness".Carl G. Jockusch & Tamara J. Lakins - 2002 - Journal of Symbolic Logic 67 (3):1078 - 1082.details
|
|
1998 European Summer Meeting of the Association for Symbolic Logic.S. Buss - 1999 - Bulletin of Symbolic Logic 5 (1):59-153.details
|
|
Computational reverse mathematics and foundational analysis.Benedict Eastaugh - manuscriptdetails
|
|
2003 Annual Meeting of the Association for Symbolic Logic.Andreas Blass - 2004 - Bulletin of Symbolic Logic 10 (1):120-145.details
|
|
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.details
|
|
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.details
|
|
Primitive recursive reverse mathematics.Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu & Alexander Melnikov - 2024 - Annals of Pure and Applied Logic 175 (1):103354.details
|
|
Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.details
|
|
The uniform content of partial and linear orders.Eric P. Astor, Damir D. Dzhafarov, Reed Solomon & Jacob Suggs - 2017 - Annals of Pure and Applied Logic 168 (6):1153-1171.details
|
|
Ordinal analysis and the infinite ramsey theorem.Bahareh Afshari & Michael Rathjen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 1--10.details
|
|
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.details
|
|
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.details
|
|
Mathematical definability.Theodore A. Slaman - 1998 - In Harold Garth Dales & Gianluigi Oliveri (eds.), Truth in mathematics. New York: Oxford University Press, Usa. pp. 233.details
|
|
2000 Annual Meeting of the Association for Symbolic Logic.A. Pillay, D. Hallett, G. Hjorth, C. Jockusch, A. Kanamori, H. J. Keisler & V. McGee - 2000 - Bulletin of Symbolic Logic 6 (3):361-396.details
|
|
Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.details
|
|
$\Pi ^{0}_{1}$ -Encodability and Omniscient Reductions.Benoit Monin & Ludovic Patey - 2019 - Notre Dame Journal of Formal Logic 60 (1):1-12.details
|
|
Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.details
|
|
Open questions about Ramsey-type statements in reverse mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.details
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.details
|
|
Reduction games, provability and compactness.Damir D. Dzhafarov, Denis R. Hirschfeldt & Sarah Reitzes - 2022 - Journal of Mathematical Logic 22 (3).details
|
|
Reverse mathematical bounds for the Termination Theorem.Silvia Steila & Keita Yokoyama - 2016 - Annals of Pure and Applied Logic 167 (12):1213-1241.details
|
|
On notions of computability-theoretic reduction between Π21 principles.Denis R. Hirschfeldt & Carl G. Jockusch - 2016 - Journal of Mathematical Logic 16 (1):1650002.details
|
|
Chains and antichains in partial orderings.Valentina S. Harizanov, Carl G. Jockusch & Julia F. Knight - 2009 - Archive for Mathematical Logic 48 (1):39-53.details
|
|
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.details
|
|
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.details
|
|
On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.details
|
|
Thin Set Versions of Hindman’s Theorem.Denis R. Hirschfeldt & Sarah C. Reitzes - 2022 - Notre Dame Journal of Formal Logic 63 (4):481-491.details
|
|
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.details
|
|
The Galvin-Prikry theorem and set existen axioms.Kazuyuki Tanaka - 1989 - Annals of Pure and Applied Logic 42 (1):81-104.details
|
|
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08.Alex J. Wilkie - 2009 - Bulletin of Symbolic Logic 15 (1):95-139.details
|
|
Computable Ramsey’s theorem for pairs needs infinitely many $$\Pi ^0_2$$ Π 2 0 sets.Gregory Igusa & Henry Towsner - 2017 - Archive for Mathematical Logic 56 (1-2):155-160.details
|
|
Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.details
|
|