Some nonstandard methods in combinatorial number theory

Studia Logica 47 (3):265 - 278 (1988)
  Copy   BIBTEX

Abstract

A combinatorial result about internal subsets of *N is proved using the Lebesgue Density Theorem. This result is then used to prove a standard theorem about difference sets of natural numbers which provides a partial answer to a question posed by Erdös and Graham.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Nonstandard natural number systems and nonstandard models.Shizuo Kamo - 1981 - Journal of Symbolic Logic 46 (2):365-376.
Applications of nonstandard analysis in additive number theory.Renling Jin - 2000 - Bulletin of Symbolic Logic 6 (3):331-341.
A descriptive view of combinatorial group theory.Simon Thomas - 2011 - Bulletin of Symbolic Logic 17 (2):252-264.
Standard sets in nonstandard set theory.Petr Andreev & Karel Hrbacek - 2004 - Journal of Symbolic Logic 69 (1):165-182.
Developments in constructive nonstandard analysis.Erik Palmgren - 1998 - Bulletin of Symbolic Logic 4 (3):233-272.
Nonstandard set theory.Peter Fletcher - 1989 - Journal of Symbolic Logic 54 (3):1000-1008.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.

Analytics

Added to PP
2009-01-28

Downloads
38 (#382,363)

6 months
3 (#643,273)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Inverse problem for cuts.Renling Jin - 2007 - Logic and Analysis 1 (1):61-89.
Applications of nonstandard analysis in additive number theory.Renling Jin - 2000 - Bulletin of Symbolic Logic 6 (3):331-341.

Add more citations

References found in this work

Review: Oliver Aberth, Computable Analysis. [REVIEW]C. Ward Henson - 1984 - Journal of Symbolic Logic 49 (3):988-989.

Add more references