Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-28T10:55:06.269Z Has data issue: false hasContentIssue false
  • English
  • Français

Ramsey's theorem and cone avoidance

Published online by Cambridge University Press:  12 March 2014

Damir D. Dzhafarov  and
Carl G. Jockusch Jr.
Damir D. Dzhafarov
Affiliation:
Department of Mathematics, University of Chicago, 5734 S. University Ave., Chicago, Il 60637, E-mail: [email protected]
Carl G. Jockusch Jr.
Affiliation:
Department of Mathematics, University of Illinoisat Urbana-Champaign, 1409 W. Green St., Urbana. Il 61801, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set H. We answer a question of the same authors by showing that H may be chosen to satisfy in addition C ≰rH, where C is a given noncomputable set. This is shown by analyzing a new and simplified proof of Seetapun's cone avoidance theorem for Ramsey's theorem. We then extend the result to show that every computable 2-coloring of pairs admits a pair of low2 infinite homogeneous sets whose degrees form a minimal pair.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 74 , Issue 2 , June 2009 , pp. 557 - 578
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Cholak, Peter A., Jockusch, Carl G. Jr., and Slaman, Theodore A., On the strength of Ramsey's theorem for pairs, this Journal, vol. 66 (2001), no. 1, pp. 1–55.Google Scholar
[2]Hirschfeldt, Denis R., Jockusch, Carl G. Jr., Kjos-Hanssen, Bjørn, Lempp, Steffen, and Slaman, Theodore A., The strength of some combinatorial principles related to Ramsey's theorem for pairs, Computational Prospects of Infinity, Part II: Presented Talks, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore (Chong, C.T., Feng, Q., Slaman, T., Woodin, H., and Yang, Y., editors), vol. 15, World Scientific, New Jersey, London, Singapore, Beijing, Shanghai, Hong Kong, Taipei, Chennai, 2008, pp. 143–161.CrossRefGoogle Scholar
[3]Hummel, Tamara Lakins, Effective versions of Ramsey's theorem: avoiding the cone above 0′, this Journal, vol. 59 (1994), no. 4, pp. 1301–1325.Google Scholar
[4]Jockusch, Carl G. Jr., Ramsey's theorem and recursion theory, this Journal, vol. 37 (1972), no. 2, pp. 268–280.Google Scholar
[5]Jockusch, Carl G. Jr., Lerman, Manuel, Soare, Robert I., and Solovay, Robert M., Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion, this Journal, vol. 54 (1989), no. 4, pp. 1288–1323.Google Scholar
[6]Jockusch, Carl G. Jr. and Soare, Robert I., Π10 classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
[7]Jockusch, Carl G. Jr. and Stephan, Frank, A cohesive set which is not high, Mathematical Logic Quarterly, vol. 39 (1993), no. 4, pp. 515–530.CrossRefGoogle Scholar
[8]Kučera, Antonín, An alternative, priority-free solution to Post's problem, Mathematical foundations of computer science, (Bratislava, 1986), Lecture Notes in Computer Science, vol. 233, Springer, Berlin, 1986, pp. 493–500.CrossRefGoogle Scholar
[9]Seetapun, David and Slaman, Theodore A., On the strength of Ramsey's theorem, Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582, Special Issue: Models of arithmetic.CrossRefGoogle Scholar
[10]Simpson, Stephen G., Degrees of unsolvability: a survey of results, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 631–652.CrossRefGoogle Scholar
[11]Simpson, Stephen G., Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.CrossRefGoogle Scholar
[12]Soare, Robert I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987, A study of computable functions and computably generated sets.CrossRefGoogle Scholar