Abstract
Good m-tuples, m-tuples of r.e. sets without Schmerl decompositions, were introduced by Schmerl, who used them to investigate the reverse mathematics of Grundy colorings of graphs. Schmerl considered only standard m, for which our definitions of weakly good, good, and strongly good coincide. The existence of good tuples for nonstandard m depends on how much induction is available in the model. We show that in models of first-order arithmetic, over a base theory of IΔ10+BΣ10+EXP, the existence of arbitrarily long weakly good tuples is equivalent to IΣ10 and the existence of arbitrarily long good or strongly good tuples is equivalent to BΣ30. Consequences for second-order arithmetic include that, over RCA0⁎, the existence of arbitrarily long good tuples is equivalent to BΣ30+¬ACA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
