✦ LIBER ✦

Ramsey's Theorem for Computably Enumerable Colorings

✍ Scribed by Tamara J. Hummel and Carl G. Jockusch, Jr.

Book ID: 124978705
Publisher: Association for Symbolic Logic
Year: 2001
Tongue: English
Weight: 211 KB
Volume: 66
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2695050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey’s theorem for colors from a metri

Ramsey’s theorem for colors from a metric space

✍ Bojańczyk, Mikołaj; Kopczyński, Eryk; Toruńczyk, Szymon 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 207 KB

Isomorphisms of Splits of Computably Enu

Isomorphisms of Splits of Computably Enumerable Sets

✍ Peter A. Cholak and Leo A. Harrington 📂 Article 📅 2003 🏛 Association for Symbolic Logic 🌐 English ⚖ 577 KB

Decomposition and Infima in the Computab

Decomposition and Infima in the Computably Enumerable Degrees

✍ Rodney G. Downey, Geoffrey L. Laforte and Richard A. Shore 📂 Article 📅 2003 🏛 Association for Symbolic Logic 🌐 English ⚖ 637 KB

On Orbits of Prompt and Low Computably E

On Orbits of Prompt and Low Computably Enumerable Sets

✍ Kevin Wald 📂 Article 📅 2002 🏛 Association for Symbolic Logic 🌐 English ⚖ 589 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 $n$-Parameter Sets

✍ R. L. Graham and B. L. Rothschild 📂 Article 📅 1971 🏛 American Mathematical Society 🌐 English ⚖ 658 KB