Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-09T03:27:08.778Z Has data issue: false hasContentIssue false
  • English
  • Français

RT22 does not imply WKL0

Published online by Cambridge University Press:  12 March 2014

Jiayi Liu
Jiayi Liu*
Affiliation:
Department of Mathematics, Central South University, South Campus, South Dormitory No. 6 Room 619, Changsha, 410083, China, E-mail: g.jiayi.liu@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We prove that by showing that for any set C not of PA-degree and any set A, there exists an infinite subset G of A or such that G ⊕ C is also not of PA-degree.

Keywords

recursion theorycomputability theoryreverse mathematicsRamsey's theoremweak Konig lemmaMathias forcing
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 77 , Issue 2 , June 2012 , pp. 609 - 620
Copyright
Copyright © Association for Symbolic Logic 2012

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] Dzhafarov, Damir D. and Jockusch, Carl G. Jr., Ramsey's theorem and cone avoidance, this Journal, vol. 74 (2009), pp. 557–578.Google Scholar
[3] Friedman, H., Some systems of second order arithmetic and their use. Proceedings of the International Congress of Mathematicians, Vancouver, vol. 1. Canadian Mathematical Congress. 1975. pp. 235–242.Google Scholar
[4] Friedman, H., Systems of second order arithmetic with restricted induction, I, II. this Journal, vol. 41 (1976), no. 2, pp. 557–559.Google Scholar
[5] Jockusch, Carl G. Jr., Ramsey's theorem and recursion theory, this Journal, vol. 37 (1972). no. 2, pp. 268–280.Google Scholar
[6] Ramsey, F. P., On a problem of formal logic, Proceedings of the London Mathematical Society, vol. 2 (1930), no. 1. pp. 264–286.CrossRefGoogle Scholar
[7] 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
[8] Simpson, Stephen G., Subsystems of second order arithmetic. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.CrossRefGoogle Scholar