✦ LIBER ✦

Ramsey's Theorem for $n$-Parameter Sets

✍ Scribed by R. L. Graham and B. L. Rothschild

Book ID: 125688658
Publisher: American Mathematical Society
Year: 1971
Tongue: English
Weight: 658 KB
Volume: 159
Category: Article
ISSN: 0002-9947
DOI: 10.2307/1996010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Borel Sets and Ramsey's Theorem

✍ Fred Galvin and Karel Prikry 📂 Article 📅 1973 🏛 Association for Symbolic Logic 🌐 English ⚖ 208 KB

Some Ramsey-type theorems for countably

Some Ramsey-type theorems for countably determined sets

✍ Josef Mlček; Pavol Zlatoš 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 124 KB

A lower bound for Ramsey's theorem

✍ Joram Hirschfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i

Ramsey's Theorem for Computably Enumerab

Ramsey's Theorem for Computably Enumerable Colorings

✍ Tamara J. Hummel and Carl G. Jockusch, Jr. 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 211 KB

Ramsey theorems for product of finite se

Ramsey theorems for product of finite sets with submeasures

✍ Saharon Shelah; Jindřich Zapletal 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 289 KB

The Independence of Ramsey's Theorem

✍ E. M. Kleinberg 📂 Article 📅 1969 🏛 Association for Symbolic Logic 🌐 English ⚖ 242 KB