Switch to: References

Add citations

You must login to add citations.
  1. Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.
    The fundamental question in reverse mathematics is to determine which set existence axioms are required to prove particular theorems of mathematics. In addition to being interesting in their own right, answers to this question have consequences in both effective mathematics and the foundations of mathematics. Before discussing these consequences, we need to be more specific about the motivating question.Reverse mathematics is useful for studying theorems of either countable or essentially countable mathematics. Essentially countable mathematics is a vague term that is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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  
  • Reverse mathematics, young diagrams, and the ascending chain condition.Kostas Hatzikiriakou & Stephen G. Simpson - 2017 - Journal of Symbolic Logic 82 (2):576-589.
    LetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$ to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
    This paper develops the very basic notions of analysis in a weak second-order theory of arithmetic BTFA whose provably total functions are the polynomial time computable functions. We formalize within BTFA the real number system and the notion of a continuous real function of a real variable. The theory BTFA is able to prove the intermediate value theorem, wherefore it follows that the system of real numbers is a real closed ordered field. In the last section of the paper, we (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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  
  • and the existence of strong divisible closures (ACA0). Section 8 deals more directly with computability issues and discusses the relationship between Π0. [REVIEW]Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1).
    Download  
     
    Export citation  
     
    Bookmark