Incompleteness for Higher-Order Arithmetic

An Example Based on Harrington’s Principle

  • Yong Cheng

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Yong Cheng
    Pages 1-31
  3. Yong Cheng
    Pages 33-52
  4. Back Matter
    Pages 99-122

About this book


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. 


Incompleteness higher order arithmetic Harrington's Principle Set Theory Martin-Harrington Theorem L-cardinals

Authors and affiliations

  • Yong Cheng
    • 1
  1. 1.School of PhilosophyWuhan UniversityWuhanChina

Bibliographic information