The Incompleteness of Peano Arithmetic with Exponentiation
We shall now turn to a formal axiom system which we call Peano Arithmetic with Exponentiation and which we abbreviate “P.E.”. We take certain correct formulas which we call axioms and provide two inference rules that enable us to prove new correct formulas from correct formulas already proved. The axioms will be infinite in number, but each axiom will be of one of nineteen easily recognizable forms; these forms are called axiom schemes. It will be convenient to classify these nineteen axiom schemes into four groups (cf. discussion that follows the display of the schemes). The axioms of Groups I and II are the so-called logical axioms and constitute a neat formalization of first-order logic with identity due to Kalish and Montague [1965], which is based on an earlier system due to Tarski [1965]. The axioms of Groups III and IV are the so-called arithmetic axioms. In displaying these axiom schemes, F, G and H are any formulas, vi and vj are any variables, and t is any term. For example, the first scheme L1 means that for any formulas F and G, the formula (F ⊃ (G ⊃ F)) is to be taken as an axiom; axiom scheme L4 means that for any variable Vi and any formulas F and G, the formula . . . (∀vi (F ⊃ G) ⊃ (∀vi (F ⊃ ∀vi G) . . . is to be taken as an axiom.