A Finite Partition Theorem with Double Exponential Bound

Saharon Shelah ()
Additional contact information
Saharon Shelah: The Hebrew University of Jerusalem, Einstein Institute of Mathematics

A chapter in The Mathematics of Paul Erdős II, 2013, pp 237-244 from Springer

Abstract: Summary We prove that double exponentiation is an upper bound to Ramsey’s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

Keywords: Linear Order; Initial Segment; Theoretic Reason; Similar Improvement; Lexicographic Order (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_18

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().