Skip to main content
Log in

Nonstandard combinatorics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Ramsey type theorems are theorems of the form: “if certain sets are partitioned at least one of the parts has some particular property”. In its finite form, Ramsey's theory will ask how big the partitioned set should be to assure this fact. Proofs of such theorems usually require a process of multiple choice, so that this apparently “pure combinatoric” field is rich in proofs that use ideal guides in making the choices. Typically they may be ultrafilters or points in the compactification of the given set. It is, therefore, not surprising that nonstandard elements are much more natural guides in some of the proofs and in the general abstract treatment.

In Section 1 we start off with some very natural examples of Ramsey type exercises that illustrate our idea. In Section 2 we give a nonstandard proof of the infinite Ramsey theorem. Section 3 tries to do the same for Hindman's theorem, and points out, where nonstandard analysis must use some hard standard facts to make the proof go through.

In Section 4 we describe a general theory of “Ramsey Properties”, identifying a Ramsey Property with its nonstandard kernel in the enlargement.

In Section 5 nonstandard analysis is used again to deduce the finite Ramsey theorems from their infinite counterpart. More generally, a “compactness theorem” is proved to work for all theorems of this type.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. C. Chang and H. J. Keisler, Model theory, North-Holland (1973).

  2. S. Glasner, Divisibility properties and the Stone-Čech compactification, Canadian Journal of Mathematics 32 (1980), pp. 993–1007.

    Google Scholar 

  3. R. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, John Wiley & Sons (1980).

  4. M. Machover, and J. Hirshfeld, Lecture Notes on Nonstandard Analysis, Springer Verlag (1969).

  5. J. Paris and L. Harrington, A mathematical incompleteness in Peano Arithmetic, Handbook of Mathematical Logic (edited by J. Barwise), North-Holland (1977), pp. 1133–1142.

  6. R. Rado, Note on combinatorial analysis, Proceedings of London Mathematical Society (2) 48 (1943–1945).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hirshfeld, J. Nonstandard combinatorics. Stud Logica 47, 221–232 (1988). https://doi.org/10.1007/BF00370553

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation