Incompleteness for Higher-Order Arithmetic: An Example Based on Harrington's Principle

By Yong Cheng

G?del's true-but-unprovable sentence from the first incompleteness theorem is purely logical in nature, i.e. not mathematically natural or interesting. An interesting problem is to find mathematically natural and interesting statements that are similarly unprovable. A lot of research has since been done in this direction, most notably by Harvey Friedman. A lot of examples of concrete incompleteness with real mathematical content have been found to date. This brief contributes to Harvey Friedman's research program on concrete incompleteness for higher-order arithmetic and gives a specific example of concrete mathematical theorems which is expressible in second-order arithmetic but the minimal system in higher-order arithmetic to prove it is fourth-order arithmetic.
This book first examines the following foundational question: are all theorems in classic mathematics expressible in second-order arithmetic provable in second-order arithmetic? The author gives a counterexample for this question and isolates this counterexample from the Martin-Harrington Theorem in set theory. It shows that the statement "Harrington's principle implies zero sharp is not provable in second-order arithmetic. This book further examines what is the minimal system in higher-order arithmetic to prove the theorem "Harrington's principle implies zero sharp and shows that it is neither provable in second-order arithmetic or third-order arithmetic, but provable in fourth-order arithmetic. The book also examines the large cardinal strength of Harrington's principle and its strengthening over second-order arithmetic and third-order arithmetic.

• Format: Paperback
• Language: English
• ISBN: 9811399484
• ISBN13: 9789811399480
• Release Date: September 2019
• Publisher: Springer
• Length: 122 Pages
• Weight: 0.45 lbs.
• Dimensions: 0.3" x 6.1" x 9.2"