Two remarks on proof theory of first-order arithmetic

In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable ${\mathrm{\Sigma }}_1$-formulas in PA. Second Paris-Harrington’s proof for their independence result is reformulated to show a `consistency’ proof of PA based on a combinatorial principle.