You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
An Unprovable Ramsey-Type Theorem
Martin Loebl and Jaroslav Nešetřil
Proceedings of the American Mathematical Society
Vol. 116, No. 3 (Nov., 1992), pp. 819-824
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2159452
Page Count: 6
You can always find the topics here!Topics: Combinatorics, Mathematical theorems, Integers, Logical theorems, Mathematical functions, Unprovability, Peano axioms, Mathematical logic, Games, Applied mathematics
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We present a new proof of the Paris-Harrington unprovable (in PA) version of Ramsey's theorem. This also yields a particularly short proof of the Ketonen-Solovay result on rapidly growing Ramsey functions.
Proceedings of the American Mathematical Society © 1992 American Mathematical Society