Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 156 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 110 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4.5 39 tok/s Pro
2000 character limit reached

The Ginsburg--Sands theorem and computability theory (2402.05990v2)

Published 8 Feb 2024 in math.LO

Abstract: The Ginsburg--Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on $\omega$: indiscrete, discrete, initial segment, final segment, and cofinite. The original proof is nonconstructive, and features an interesting application of Ramsey's theorem for pairs ($\mathsf{RT}2_2$). We analyze this principle in computability theory and reverse mathematics, using Dorais's formalization of CSC spaces. Among our results are that the Ginsburg-Sands theorem for CSC spaces is equivalent to $\mathsf{ACA}_0$, while for Hausdorff spaces it is provable in $\mathsf{RCA}_0$. Furthermore, if we enrich a CSC space by adding the closure operator on points, then the Ginsburg-Sands theorem turns out to be equivalent to the chain/antichain principle ($\mathsf{CAC}$). The most surprising case is that of the Ginsburg-Sands theorem restricted to $T_1$ spaces. Here, we show that the principle lies strictly between $\mathsf{ACA}_0$ and $\mathsf{RT}2_2$, yielding arguably the first natural theorem from outside logic to occupy this interval. As part of our analysis of the $T_1$ case we introduce a new class of purely combinatorial principles below $\mathsf{ACA}_0$ and not implied by $\mathsf{RT}2_2$ which form a strict hierarchy generalizing the stable Ramsey's theorem for pairs ($\mathsf{SRT}2_2$). We show that one of these, the $\Sigma0_2$ subset principle ($\Sigma0_2$-$\mathsf{Subset}$), has the property that it, together with the cohesive principle ($\mathsf{COH}$), is equivalent over $\mathsf{RCA}_0$ to the Ginsburg--Sands theorem for $T_1$ CSC spaces.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. Heidi Benham. Ph.D. thesis – University of Connecticut, to appear.
  2. On the strength of Ramsey’s theorem for pairs. J. Symbolic Logic, 66(1):1–55, 2001.
  3. On the role of the collection principle for Σ20subscriptsuperscriptΣ02\Sigma^{0}_{2}roman_Σ start_POSTSUPERSCRIPT 0 end_POSTSUPERSCRIPT start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT-formulas in second-order reverse mathematics. Proc. Amer. Math. Soc., 138(3):1093–1100, 2010.
  4. The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s lemma. Trans. Amer. Math. Soc., 374(8):5545–5581, 2021.
  5. The metamathematics of stable Ramsey’s theorem for pairs. J. Amer. Math. Soc., 27(3):863–892, 2014.
  6. The inductive strength of Ramsey’s Theorem for Pairs. Adv. Math., 308:121–141, 2017.
  7. Reverse mathematics, computability, and partitions of trees. J. Symb. Log., 74(1):201–215, 2009.
  8. Milliken’s tree theorem and its applications: a computability-theoretic perspective. Memoirs of the American Mathematical Society. American Mathematical Society, to appear.
  9. Andrew DeLapo. Ph.D. thesis – University of Connecticut, to appear.
  10. Franccois G. Dorais. Reverse mathematics of compact countable second-countable spaces. arXiv: Logic, 2011.
  11. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, New York, 2010.
  12. A Δ20subscriptsuperscriptΔ02\Delta^{0}_{2}roman_Δ start_POSTSUPERSCRIPT 0 end_POSTSUPERSCRIPT start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT set with no infinite low subset in either it or its complement. J. Symbolic Logic, 66(3):1371–1381, 2001.
  13. Damir D. Dzhafarov. The RM Zoo, website: http://rmzoo.uconn.edu, 2015.
  14. Damir D. Dzhafarov and Carl G. Jockusch, Jr. Ramsey’s theorem and cone avoidance. J. Symbolic Logic, 74(2):557–578, 2009.
  15. Reverse Mathematics: Problems, Reductions, and Proofs. Theory and Applications of Computability. Springer Nature, 2022.
  16. Coloring trees in reverse mathematics. Adv. Math., 318:497–514, 2017.
  17. Minimal infinite topological spaces. Am. Math. Mon., 86:574–576, 1979.
  18. J. D. Halpern and H. Läuchli. A partition theorem. Trans. Amer. Math. Soc., 124:360–367, 1966.
  19. Denis R. Hirschfeldt. Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles. Lecture notes series / Institute for Mathematical Sciences, National University of Singapore. World Scientific Publishing Company Incorporated, 2014.
  20. Combinatorial principles weaker than Ramsey’s theorem for pairs. J. Symbolic Logic, 72(1):171–206, 2007.
  21. Jeffry L. Hirst. Combinatorics in Subsystems of Second Order Arithmetic. PhD thesis, The Pennsylvania State University, 1987.
  22. Tamara Hummel and Carl G. Jockusch, Jr. Generalized cohesiveness. J. Symbolic Logic, 64(2):489–516, 1999.
  23. James Hunter. Higher-order reverse topology. PhD thesis, University of Wisconsin - Madison, 2008.
  24. A cohesive set which is not high. Math. Logic Quart., 39(4):515–530, 1993.
  25. Carl G. Jockusch, Jr. Ramsey’s theorem and recursion theory. J. Symbolic Logic, 37:268–280, 1972.
  26. Filters on computable posets. Notre Dame J. Formal Logic, 47(4):479–485, 2006.
  27. Separating principles below Ramsey’s theorem for pairs. J. Math. Log., 13(2):1350007, 44, 2013.
  28. Lu Liu. R⁢T22𝑅subscriptsuperscript𝑇22RT^{2}_{2}italic_R italic_T start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT does not imply W⁢K⁢L0𝑊𝐾subscript𝐿0WKL_{0}italic_W italic_K italic_L start_POSTSUBSCRIPT 0 end_POSTSUBSCRIPT. J. Symbolic Logic, 77(2):609–620, 2012.
  29. A note on minimal infinite subspaces of a product space. Irish Math. Soc. Bull., (34):26–29, 1995.
  30. Joseph R. Mileti. Partition Theorems and Computability Theory. PhD thesis, University of Illinois at Urbana-Champaign, 2004.
  31. Keith R. Milliken. A Ramsey theorem for trees. J. Combin. Theory Ser. A, 26(3):215–237, 1979.
  32. Keith R. Milliken. A partition theorem for the infinite subtrees of a tree. Trans. Amer. Math. Soc., 263(1):137–148, 1981.
  33. Keith Robert Milliken. SOME RESULTS IN RAMSEY THEORY. ProQuest LLC, Ann Arbor, MI, 1975. Thesis (Ph.D.)–University of California, Los Angeles.
  34. 𝖲𝖱𝖳𝟤𝟤subscriptsuperscript𝖲𝖱𝖳22\sf{SRT}^{2}_{2}sansserif_SRT start_POSTSUPERSCRIPT sansserif_2 end_POSTSUPERSCRIPT start_POSTSUBSCRIPT sansserif_2 end_POSTSUBSCRIPT does not imply 𝖱𝖳𝟤𝟤subscriptsuperscript𝖱𝖳22\sf{RT}^{2}_{2}sansserif_RT start_POSTSUPERSCRIPT sansserif_2 end_POSTSUPERSCRIPT start_POSTSUBSCRIPT sansserif_2 end_POSTSUBSCRIPT in ω𝜔\omegaitalic_ω-models. Adv. Math., 389:Paper No. 107903, 32, 2021.
  35. Carl Mummert. On the reverse mathematics of general topology. ProQuest LLC, Ann Arbor, MI, 2005. Thesis (Ph.D.)–The Pennsylvania State University.
  36. On the mathematical and foundational significance of the uncountable. J. Math. Log., 19(1):1950001, 40, 2019.
  37. ΣnsubscriptΣ𝑛\Sigma_{n}roman_Σ start_POSTSUBSCRIPT italic_n end_POSTSUBSCRIPT-collection schemas in arithmetic. In Logic Colloquium ’77 (Proc. Conf., Wrocław, 1977), volume 96 of Stud. Logic Foundations Math., pages 199–209. North-Holland, Amsterdam-New York, 1978.
  38. Ludovic Patey. The strength of the tree theorem for pairs in reverse mathematics. J. Symb. Log., 81(4):1481–1499, 2016.
  39. Ludovic Patey. Iterative forcing and hyperimmunity in reverse mathematics. Computability, 6(3):209–221, 2017.
  40. Sam Sanders. Reverse mathematics of topology: dimension, paracompactness, and splittings. Notre Dame J. Form. Log., 61(4):537–559, 2020.
  41. Sam Sanders. Nets and reverse mathematics: a pilot study. Computability, 10(1):31–62, 2021.
  42. On the strength of Ramsey’s theorem. Notre Dame J. Formal Logic, 36(4):570–582, 1995. Special Issue: Models of arithmetic.
  43. Paul Shafer. The strength of compactness for countable complete linear orders. Computability, 9(1):25–36, 2020.
  44. Richard A. Shore. Reverse mathematics: the playground of logic. Bull. Symbolic Logic, 16(3):378–402, 2010.
  45. Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in Logic. Cambridge University Press, Cambridge, second edition, 2009.
  46. Robert I. Soare. Turing Computability: Theory and Applications. Springer Publishing Company, Incorporated, 1st edition, 2016.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 7 likes.

Upgrade to Pro to view all of the tweets about this paper: