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...

• 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"