Switch to: References

Add citations

You must login to add citations.
  1. 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.
    We study the first-order consequences of Ramsey’s Theorem fork-colourings ofn-tuples, for fixed$n, k \ge 2$, over the relatively weak second-order arithmetic theory$\mathrm {RCA}^*_0$. Using the Chong–Mourad coding lemma, we show that in a model of$\mathrm {RCA}^*_0$that does not satisfy$\Sigma ^0_1$induction,$\mathrm {RT}^n_k$is equivalent to its relativization to any proper$\Sigma ^0_1$-definable cut, so its truth value remains unchanged in all extensions of the model with the same first-order universe.We give a complete axiomatization of the first-order consequences of$\mathrm {RCA}^*_0 + \mathrm {RT}^n_k$for$n \ge (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Primitive recursive reverse mathematics.Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu & Alexander Melnikov - 2024 - Annals of Pure and Applied Logic 175 (1):103354.
    Download  
     
    Export citation  
     
    Bookmark