David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 47 (3):221 - 232 (1988)
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.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Mauro Di Nasso (1998). Pseudo-Superstructures as Nonstandard Universes. Journal of Symbolic Logic 63 (1):222 - 236.
S. Salbany & Todor Todorov (2000). Nonstandard Analysis in Topology: Nonstandard and Standard Compactifications. Journal of Symbolic Logic 65 (4):1836-1840.
V. Kanovei (1995). Uniqueness, Collection, and External Collapse of Cardinals in Ist and Models of Peano Arithmetic. Journal of Symbolic Logic 60 (1):318-324.
Erik Palmgren (1998). Developments in Constructive Nonstandard Analysis. Bulletin of Symbolic Logic 4 (3):233-272.
Petr Andreev & Karel Hrbacek (2004). Standard Sets in Nonstandard Set Theory. Journal of Symbolic Logic 69 (1):165-182.
Andreas Blass (1977). Amalgamation of Nonstandard Models of Arithmetic. Journal of Symbolic Logic 42 (3):372-386.
Mauro Di Nasso (2002). An Axiomatic Presentation of the Nonstandard Methods in Mathematics. Journal of Symbolic Logic 67 (1):315 - 325.
Peter Fletcher (1989). Nonstandard Set Theory. Journal of Symbolic Logic 54 (3):1000-1008.
Shizuo Kamo (1981). Nonstandard Natural Number Systems and Nonstandard Models. Journal of Symbolic Logic 46 (2):365-376.
Added to index2009-01-28
Total downloads14 ( #112,805 of 1,098,996 )
Recent downloads (6 months)2 ( #175,277 of 1,098,996 )
How can I increase my downloads?