Abstract
Ramsey's Theorem deals with colorings of the k-element subsets of a fixed infinite set. The Dual Ramsey Theorem deals with colorings of the k-element partitions of a fixed infinite set. We review the statement of the Dual Ramsey Theorem and of its generalization to A-partitions. Here A is a finite alphabet. We discuss the problem of optimal recursion-theoretic bounds for the Dual Ramsey Theorem. We point out applications of the Dual Ramsey Theorem to initial segment constructions in degree theory. We state a result of Brackin concerning partitions which have no coarsenings of higher Turing degree. In an appendix we summarize the known results (and present two new results) concerning "nearly recursive" (i.e. bi-immune free) Turing degrees.
This paper is in final form. The results which are proved here will not be published elsewhere.
Research partially supported by NSF grant MCS 8107867.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Z. Adamowicz, On finite lattices of degrees of constructibility of reals, J. Symbolic Logic 41(1976), pp. 313–322.
J. Baumgartner and R. Laver, Iterated perfect-set forcing, Annals of Math. Logic 17(1979), pp. 271–288.
S. Brackin, Ph.D. Thesis, Pennsylvania State University, in preparation.
T.J. Carlson, in preparation (but see [5], [10], and [29]).
T.J. Carlson and S.G. Simpson, A dual form of Ramsey's theorem, Advances in Mathematics 53 (1984), pp. 265–290.
P. Clote, A recursion-theoretic analysis of the clopen Ramsey theorem, J. Symbolic Logic 49 (1984), pp. 376–400.
Y. Ershov and M.A. Taitslin, The undecidability of certain theories, Algebra i Logika 2(1963), pp. 37–41.
H. Friedman, K. McAloon and S.G. Simpson, A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis, in: Patras Logic Symposion (ed. G. Metakides), North-Holland, 1982, pp. 197–230.
F. Galvin and K. Prikry, Borel sets and Ramsey's theorem, J. Symbolic Logic 38(1973), pp. 193–198.
R.L. Graham, Recent developments in Ramsey theory, International Congress of Mathematicians, Warsaw, 1983, 14 pages.
R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, Wiley, 1980, 174 pages.
S. Grigorieff, Combinatorics on ideals and forcing, Annals of Math. Logic 3(1971), pp. 363–394.
J.D. Halpern and H. Läuchli, A partition theorem, Transactions Amer. Math. Soc. 124(1966), pp. 360–367.
C.G. Jockusch, Jr., The degrees of bi-immune sets, Zeitschrift f. math. Logik u. Grundlagen d. Math. 15 (1969), pp. 135–140.
C.G. Jockusch, Jr., Upward closure of bi-immune degrees, Zeitschrift f. math. Logik u. Grundlagen d. Math. 18(1972), pp. 285–287.
C.G. Jockusch, Jr., gP 01 classes and Boolean combinations of recursively enumerable sets, J. Symbolic Logic 39(1974), pp. 95–96.
C.G. Jockusch, Jr., Ramsey's theorem and recursion theory, J. Symbolic Logic 37(1972), pp. 268–280.
C.G. Jockusch, Jr. and R.I. Soare, Π01 classes and degrees of theories, Transactions Amer. Math. Soc. 173(1972), pp. 33–56.
S.A. Kurtz, Notions of weak genericity, J. Symbolic Logic 48(1983), pp. 764–770.
A.H. Lachlan, Distributive initial segments of the degrees of unsolvability, Zeitschrift f. math. Logik u. Grundlagen d. Math. 14(1968), pp. 457–472.
A.H. Lachlan, Solution to a problem of Spector, Canadian J. Math. 23(1971), pp. 247–256.
R. Laver, Products of infinitely many perfect trees, J.London Math.Soc. (2), 29 (1984), pp. 385–396.
M. Lerman, Initial segments of the degrees of unsolvability, Annals of Math. 93(1971), pp. 365–389.
M. Lerman, Degrees of Unsolvability: Local and Global Theory, Springer-Verlag, 1983, 307 pages.
A.R.D. Mathias, Surrealist landscape with figures, Periodica Mathematica Hungarica 10 (1979), pp. 109–175.
K.R. Milliken, A Ramsey theorem for trees, J. Combinatorial Theory A, 26(1979), pp. 215–237.
W. Miller and D.A. Martin, The degrees of hyperimmune sets, Zeitschrift f. math. Logik u. Grundlagen d. Math. 14(1968), pp. 159–166.
A. Miller and K. Prikry, in preparation.
K. Prikry, manuscript describing results of T.J. Carlson, November 1982, 34 pages.
H.J. Prömel, S.G. Simpson, and B. Voigt, A dual form of Erdös-Rado's canonization theorem, in preparation.
P. Pudlak and J. Tuma, Every finite lattice can be embedded in the lattice of all equivalences over a finite set, Commentations math. Univ. Carolinae 18(1977), pp. 409–414.
F.P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30(1930), pp. 264–286.
G.E. Sacks, Forcing with perfect closed sets, in: Axiomatic Set Theory (Proceedings of the 13th Symposium in Pure Mathematics; ed. by D.S. Scott), Amer. Math. Soc., 1971, pp. 331–355.
S.G. Simpson, Sets which do not have subsets of every higher degree, J. Symbolic Logic 43(1978), pp. 135–138.
S.G. Simpson, First-order theory of the degrees of recursive unsolvability, Annals of Math. 105(1977), pp. 121–139.
R.I. Soare, Sets with no subset of higher degree, J. Symbolic Logic 34(1969), pp. 53–56.
R.M. Solovay, Hyperarithmetically encodable sets, Transactions Amer. Math. Soc. 239(1978), pp. 99–122.
C. Spector, On degrees of recursive unsolvability, Annals of Math. 64(1956), pp. 581–592.
S.K. Thomason, Sublattices and initial segments of the degrees of unsolvability, Canadian J. Math. 22(1970), pp. 569–581.
S.K. Thomason, On initial segments of hyperdegrees, J. Symbolic Logic 35(1970), pp. 189–197.
C.E.M. Yates, Initial segments and implications for the structure of degrees, in: Conference in Mathematical Logic (London 1970; ed. by W. Hodges), Springer-Verlag, Lecture Notes in Math. 255, 1972, pp. 303–335.
C.E.M. Yates, Banach-Mazur games, comeagre sets, and degrees of unsolvability, Math. Proc. of the Cambridge Phil. Soc. 79(1976), pp. 195–220.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Simpson, S.G. (1985). Recursion theoretic aspects of the dual ramsey theorem. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076230
Download citation
DOI: https://doi.org/10.1007/BFb0076230
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15673-4
Online ISBN: 978-3-540-39596-6
eBook Packages: Springer Book Archive