论文信息 - Regressive Ramsey Numbers Are Ackermannian - 字舞流文

Regressive Ramsey Numbers Are Ackermannian

We give an elementary proof of the fact that regressive Ramsey numbers are Ackermannian. This fact was first proved by Kanamori and McAloon with mathematical logic techniques.

Saharon Shelah | Menachem Kojman | S. Shelah | M. Kojman

[1] Paul Erdös,et al. Some Bounds for the Ramsey-Paris-Harrington Numbers , 1981, J. Comb. Theory, Ser. A.

[2] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[3] J. Paris. A Mathematical Incompleteness in Peano Arithmetic , 1977 .

[4] Vojtech Rödl,et al. On Canonical Ramsey Numbers for Complete Graphs versus Paths , 1993, J. Comb. Theory, Ser. B.

[5] Saharon Shelah,et al. Primitive recursive bounds for van der Waerden numbers , 1988 .

[6] Kenneth McAloon,et al. On Gödel incompleteness and finite combinatorics , 1987, Ann. Pure Appl. Log..

[7] A. Breton. Manifeste du surréalisme , 1924 .

[8] Alon Nilli. Shelah’s Proof of the Hales-Jewett Theorem , 1990 .

[9] George Mills,et al. Ramsey-Paris-Harrington Numbers for Graphs , 1985, J. Comb. Theory, Ser. A.

[10] Cristian S. Calude. Theories of computational complexity , 1988 .