Lecture series on concrete incompleteness-3: Paris Harrington theorem

Value of the Information & Strength of the Argument

The lecture provides a detailed and rigorous proof of the Paris-Harrington theorem’s unprovability in PA, which is a significant result in mathematical logic. The argumentation is solid, building from basic definitions to a complex combinatorial construction. The speaker carefully explains each step, emphasizing the role of ordinal notations and the shift graph coloring. The proof is self-contained, though it requires a high level of mathematical maturity. The value lies in the deep insight into the connection between combinatorial principles and proof theory, and the argumentation is convincing and well-structured.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is scientifically rigorous, with a clear logical structure and careful definitions. The speaker cites sources: he mentions following the work of an author (likely ‘Rathjen’ or similar) and refers to a paper by Ketonen and Solovay published in the Proceedings of the AMS. However, the lecture relies on unpublished lecture notes, which are not peer-reviewed. The title accurately reflects the content, as the lecture is indeed about the Paris-Harrington theorem. The presentation is technical and assumes prior knowledge of ordinal analysis and proof theory.

The title accurately reflects the content: the lecture is the third in a series on concrete incompleteness and focuses on the Paris-Harrington theorem.

8/10

The lecture is given by a recognized expert (Prof. Andreas Weiermann) and presents a rigorous proof of the Paris-Harrington theorem, a well-established result in mathematical logic. The content is technically accurate and follows standard mathematical practice. However, it is a lecture, not a peer-reviewed publication, and relies on unpublished lecture notes by another author, which slightly reduces the score.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction and non-mathematical interlude with paintings.
• 02:00Start of the mathematical content: introduction to the Paris-Harrington theorem and its relation to Ramsey's theorem.
• 10:00Definition of ordinal normal forms and the rank function.
• 20:00Definition of the shift graph coloring and the first lemma about homogeneous sets.
• 30:00Construction of the partition for the Paris-Harrington theorem.
• 40:00Statement and proof of the main lemma: homogeneous sets are short.
• 50:00Induction step and conclusion of the proof.

• Lecture notes by an author (possibly Rathjen) on ordinal analysis — The speaker mentions following the work of an author (likely Rathjen) and using his unpublished lecture notes from a university.
• Ketonen and Solovay, 'Rapidly growing Ramsey functions', Proceedings of the AMS — The speaker references this paper as the origin of comparing the Paris-Harrington function with fast-growing functions.

• Paris-Harrington theorem — Wikipedia article confirming the theorem and its unprovability in PA.
• Ketonen and Solovay, 'Rapidly growing Ramsey functions' — The paper is a standard reference for the growth rate of the Paris-Harrington function.