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}
}
  • L. Bienvenu, Ludovic Patey, Paul Shafer
  • Published 2014
  • Mathematics
  • arXiv: Logic
  • 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

    Figures and Tables from this paper

    The reverse mathematics of Ramsey-type theorems
    • 11
    • PDF
    The strength of the Tree Theorem for Pairs in Reverse Mathematics
    • 15
    • PDF
    Partial Orders and Immunity in Reverse Mathematics
    • 6
    • PDF
    OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
    • Ludovic Patey
    • Mathematics, Computer Science
    • The Bulletin of Symbolic Logic
    • 2016
    • 9
    • PDF
    Computability Theory, Nonstandard Analysis, and their Connections
    • 24
    • PDF
    Randomness Notions and Reverse Mathematics
    • PDF
    RAMSEY’S HEOREM FOR PAIRS IN REVERSE MATHEMATICS
    • 2020
    • PDF

    References

    SHOWING 1-10 OF 47 REFERENCES
    Combinatorial principles weaker than Ramsey's Theorem for pairs
    • 127
    • Highly Influential
    • PDF
    The strength of the Tree Theorem for Pairs in Reverse Mathematics
    • 15
    • PDF
    The weakness of being cohesive, thin or free in reverse mathematics
    • 40
    • PDF
    Ramsey-type graph coloring and diagonal non-computability
    • 9
    • PDF
    A packed Ramsey’s theorem and computability theory
    • 1
    • Highly Influential
    • PDF
    Some logically weak Ramseyan theorems
    • 24
    • Highly Influential
    • PDF
    On The Strength of Ramsey's Theorem for Pairs
    • 198
    • Highly Influential
    • PDF
    SOMEWHERE OVER THE RAINBOW RAMSEY THEOREM FOR PAIRS
    • 19
    • PDF
    On the strength of the finite intersection principle
    • 13
    • Highly Influential
    • PDF
    The atomic model theorem and type omitting
    • 52
    • Highly Influential
    • PDF