- $\Pi ^{0}_{1}$ -Encodability and Omniscient Reductions.Benoit Monin & Ludovic Patey - 2019 - Notre Dame Journal of Formal Logic 60 (1):1-12.details
|
|
The definability strength of combinatorial principles.Wei Wang - 2016 - Journal of Symbolic Logic 81 (4):1531-1554.details
|
|
Open questions about Ramsey-type statements in reverse mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.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
|
|
The strength of ramsey’s theorem for coloring relatively large sets.Lorenzo Carlucci & Konrad Zdanowski - 2014 - Journal of Symbolic Logic 79 (1):89-102.details
|
|
Rainbow Ramsey Theorem for triples is strictly weaker than the Arithmetical Comprehension Axiom.Wei Wang - 2013 - Journal of Symbolic Logic 78 (3):824-836.details
|
|
(1 other version)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
|
|
Reverse Mathematics and Ramsey Properties of Partial Orderings.Jared Corduan & Marcia Groszek - 2016 - Notre Dame Journal of Formal Logic 57 (1):1-25.details
|
|
On Mathias generic sets.Peter A. Cholak, Damir D. Dzhafarov & Jeffry L. Hirst - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 129--138.details
|
|
Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.details
|
|
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.details
|
|
The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.details
|
|
Random reals, the rainbow Ramsey theorem, and arithmetic conservation.Chris J. Conidis & Theodore A. Slaman - 2013 - Journal of Symbolic Logic 78 (1):195-206.details
|
|
Term extraction and Ramsey's theorem for pairs.Alexander P. Kreuzer & Ulrich Kohlenbach - 2012 - Journal of Symbolic Logic 77 (3):853-895.details
|
|
Reverse mathematics and a Ramsey-type König's Lemma.Stephen Flood - 2012 - Journal of Symbolic Logic 77 (4):1272-1280.details
|
|
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.details
|
|
Ramsey's Theorem and Cone Avoidance.Damir D. Dzhafarov & Carl G. Jockusch - 2009 - Journal of Symbolic Logic 74 (2):557-578.details
|
|
Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.details
|
|
(1 other version)Sets without Subsets of Higher Many-One Degree.Patrizio Cintioli - 2005 - Notre Dame Journal of Formal Logic 46 (2):207-216.details
|
|
(1 other version)Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.details
|
|
Ramsey's theorem for computably enumerable colorings.Tamara Hummel & Carl Jockusch - 2001 - Journal of Symbolic Logic 66 (2):873-880.details
|
|
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.details
|
|
Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.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
|
|
The weakness of the pigeonhole principle under hyperarithmetical reductions.Benoit Monin & Ludovic Patey - 2020 - Journal of Mathematical Logic 21 (3):2150013.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
|
|
On the uniform computational content of ramsey’s theorem.Vasco Brattka & Tahina Rakotoniaina - 2017 - Journal of Symbolic Logic 82 (4):1278-1316.details
|
|
(1 other version)RT2 2 does not imply WKL0.Jiayi Liu - 2012 - Journal of Symbolic Logic 77 (2):609-620.details
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.details
|
|
Ramsey-like theorems and moduli of computation.Ludovic Patey - 2022 - Journal of Symbolic Logic 87 (1):72-108.details
|
|
Generics for computable Mathias forcing.Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst & Theodore A. Slaman - 2014 - Annals of Pure and Applied Logic 165 (9):1418-1428.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
|
|
Generalized cohesiveness.Tamara Hummel & Carl Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.details
|
|
(Extra)Ordinary Equivalences with the Ascending/Descending Sequence Principle.Marta Fiori-Carones, Alberto Marcone, Paul Shafer & Giovanni Soldà - 2024 - Journal of Symbolic Logic 89 (1):262-307.details
|
|
The reverse mathematics of the thin set and erdős–moser theorems.Lu Liu & Ludovic Patey - 2022 - Journal of Symbolic Logic 87 (1):313-346.details
|
|
Relationships between computability-theoretic properties of problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.details
|
|
(15 other versions)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
|
|
1998 European Summer Meeting of the Association for Symbolic Logic.S. Buss - 1999 - Bulletin of Symbolic Logic 5 (1):59-153.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
|
|
Dominating the Erdős–Moser theorem in reverse mathematics.Ludovic Patey - 2017 - Annals of Pure and Applied Logic 168 (6):1172-1209.details
|
|
The strength of the tree theorem for pairs in reverse mathematics.Ludovic Patey - 2016 - Journal of Symbolic Logic 81 (4):1481-1499.details
|
|
Ramsey’s theorem for pairs, collection, and proof size.Leszek Aleksander Kołodziejczyk, Tin Lok Wong & Keita Yokoyama - 2023 - Journal of Mathematical Logic 24 (2).details
|
|
Strong reductions between combinatorial principles.Damir D. Dzhafarov - 2016 - Journal of Symbolic Logic 81 (4):1405-1431.details
|
|