Skip to main content
SpringerLink
Log in
Book cover

Cambridge Summer School in Mathematical Logic pp 361–418Cite as

Infinitary combinatorics

  • Set Theory And Combinatorics
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 337))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. P. Ramsey, On a problem of formal logic, Proceedings of the London Mathematical Society (2), Vol. 30 (1930), pp. 264–286.

    Article  MathSciNet  MATH  Google Scholar 

  2. C. C. Chang and H. J. Keisler, Model Theory, to appear.

    Google Scholar 

  3. P. J. Cohen, Set Theory and the Continuum Hypothesis, W. A. Benjamin, 1966.

    Google Scholar 

  4. P. Erdös and A. Hajnal, On the structure of set mappings, Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 9 (1958), pp. 111–131.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Erdös, A. Hajnal, and R. Rado, Partition relations for cardinal numbers, Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 16 (1965), pp. 93–196.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Erdös and R. Rado, Combinatorial theorems on classification of subsets of a given set, Proceedings of the London Mathematical Society (3), Vol. 2 (1952), pp. 417–439.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Erdös and A. Tarski, On families of mutually exclusive sets, Annals of Mathematics, Vol. 44 (1943), pp. 315–329.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Galvin and K. Prikry, to appear.

    Google Scholar 

  9. J. Henle and E. M. Kleinberg, A combinatorial proof of a combinatorial theorem, to appear.

    Google Scholar 

  10. C. Jockusch, Ramsey's theorem and recursion theory, The Journal of Symbolic Logic, to appear.

    Google Scholar 

  11. E. M. Kleinberg, The independence of Ramsey's theorem, The Journal of Symbolic Logic, Vol. 34 (1969), pp. 205–206.

    Article  MathSciNet  MATH  Google Scholar 

  12. E. M. Kleinberg, Strong partition properties for infinite cardinals, The Journal of Symbolic Logic, Vol. 35 (1970), pp. 410–428.

    Article  MathSciNet  MATH  Google Scholar 

  13. E. M. Kleinberg, The equiconsistency of two large cardinal axioms, to appear.

    Google Scholar 

  14. E. M. Kleinberg and J. Seiferas, On infinite exponent partition relations and well-prdered choice, to appear.

    Google Scholar 

  15. E. M. Kleinberg and R. A. Shore, On large cardinals and partition relations, The Journal of Symbolic Logic, Vol. 36 (1971), pp. 305–307.

    Article  MathSciNet  MATH  Google Scholar 

  16. D. A. Martin, Measurable cardinals and analytic games, Fundamenta Mathematicae, Vol. 66 (1970), pp. 287–291.

    MathSciNet  MATH  Google Scholar 

  17. A. R. D. Mathias, Doctoral dissertation, Peterhouse, Cambridge, England.

    Google Scholar 

  18. M. Morley, Partitions and models, Proc. Summer School in Logic, Leeds 1967, Springer, Berlin 1968, pp. 109–158.

    Google Scholar 

  19. J. Mycielski, On the axiom of determinateness, Fund. Math., Vol. 53, (1963–64), pp.

    Google Scholar 

  20. J. B. Paris, ZF ⊢ Σ 04 determinateness, The Journal of Symbolic Logic, to appear.

    Google Scholar 

  21. W. Reinhardt and J. Silver, On some problems of Erdös and Hajnal, Notices of the American Mathematical Society, Vol. 12 (1965), p. 723.

    Google Scholar 

  22. H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw Hill, 1967.

    Google Scholar 

  23. F. Rowbottom, Some strong axioms of infinity incompatible with the axiom of constructibility, Annals of Mathematical Logic, Vol. 3 (1971), pp. 1–44.

    Article  MathSciNet  MATH  Google Scholar 

  24. J. Silver, Some applications of model theory in set theory, Doctoral dissertation, University of California, Berkeley, California, 1966.

    Google Scholar 

  25. J. Silver, Every analytic set is Ramsey, The Journal of Symbolic Logic, Vol. 35 (1970), pp. 60–64.

    Article  MathSciNet  MATH  Google Scholar 

  26. R. Soare, Sets with no subset of higher degree, The Journal of Symbolic Logic, Vol. 34 (1969), pp. 53–56.

    Article  MathSciNet  MATH  Google Scholar 

  27. R. M. Solovay, A nonconstructible Δ 13 set of integers, Transactions of the American Mathematical Society, Vol. 127 (1967), pp. 50–75.

    MathSciNet  MATH  Google Scholar 

  28. R. M. Solovay, A model for set theory in which every set of reals is Lebesgue measurable, Annals of Mathematics, Vol. 92 (1970), pp. 1–56.

    Article  MathSciNet  MATH  Google Scholar 

  29. R. M. Solovay, Real-valued measurable cardinals, Proc. of Symposia in Pure Mathematics, Vol. XIII(1), American Mathematical Society 1971, pp. 397–428.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, USA

    E. M. Kleinberg

Authors
  1. E. M. Kleinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. R. D. Mathias H. Rogers

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Kleinberg, E.M. (1973). Infinitary combinatorics. In: Mathias, A.R.D., Rogers, H. (eds) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066782

Download citation

  • DOI: https://doi.org/10.1007/BFb0066782

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05569-3

  • Online ISBN: 978-3-540-36884-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation