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

• Κύριος συγγραφέας: Cheng, Yong (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Singapore : Springer Singapore : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: SpringerBriefs in Mathematics,
• Θέματα: Mathematical logic.; Mathematical Logic and Foundations.
• Φυσική περιγραφή: XIV, 122 p. 1 illus. online resource.
• ISBN: 9789811399497
• ISSN: 2191-8198
• DOI: 10.1007/978-981-13-9949-7

The book examines the following foundation question: are all theorems in classic mathematics which are expressible in second order arithmetic provable in second order arithmetic? In this book, the author gives a counterexample for this question and isolates this counterexample from Martin-Harrington theorem in set theory. It shows that the statement "Harrington's principle implies zero sharp" is not provable in second order arithmetic. The book also examines what is the minimal system in higher order arithmetic to show that Harrington's principle implies zero sharp and the large cardinal strength of Harrington's principle and its strengthening over second and third order arithmetic. .