Abstract
The chapter discusses the Paris–Harrington partition theorem (PH), which is used to prove the consistency of Peano arithmetic (PA). A finitary π02 combinatorial principle capturing π11-CAO, based on end-homogeneity instead of homogeneity is presented.. The method of producing theories with incomparable and equal consistency strength along is demonstrated along with examples.
| Original language | English |
|---|---|
| Pages (from-to) | 145-160 |
| Number of pages | 16 |
| Journal | Studies in Logic and the Foundations of Mathematics |
| Volume | 112 |
| Issue number | C |
| DOIs | |
| State | Published - 1 Jan 1984 |