On the logical strengths of partial solutions to mathematical problems
@article{Bienvenu2014OnTL, title={On the logical strengths of partial solutions to mathematical problems}, author={L. Bienvenu and Ludovic Patey and Paul Shafer}, journal={arXiv: Logic}, year={2014}, volume={4}, pages={30-71} }
We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood [‘Reverse mathematics and a Ramsey-type Konig's lemma’, J. Symb. Log. 77 (2012) 1272–1280], we say that a Ramsey-type variant of a problem is the problem with the same instances but whose solutions are the infinite partial solutions to the original problem. We study Ramsey… CONTINUE READING
8 Citations
The strength of the Tree Theorem for Pairs in Reverse Mathematics
- Mathematics, Computer Science
- J. Symb. Log.
- 2016
- 15
- PDF
OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- Mathematics, Computer Science
- The Bulletin of Symbolic Logic
- 2016
- 9
- PDF
Computability Theory, Nonstandard Analysis, and their Connections
- Mathematics, Computer Science
- J. Symb. Log.
- 2019
- 24
- PDF
References
SHOWING 1-10 OF 47 REFERENCES
Combinatorial principles weaker than Ramsey's Theorem for pairs
- Mathematics, Computer Science
- J. Symb. Log.
- 2007
- 127
- Highly Influential
- PDF
The strength of the Tree Theorem for Pairs in Reverse Mathematics
- Mathematics, Computer Science
- J. Symb. Log.
- 2016
- 15
- PDF
Ramsey-type graph coloring and diagonal non-computability
- Mathematics, Computer Science
- Arch. Math. Log.
- 2015
- 9
- PDF
On The Strength of Ramsey's Theorem for Pairs
- Mathematics, Computer Science
- J. Symb. Log.
- 2001
- 198
- Highly Influential
- PDF