more from this thinker | more from this text
Full Idea
A common formulation of Peano Arithmetic uses 2nd-order logic, the constant '1', and a one-place function 's' ('successor'). Three axioms then give '1 is not a successor', 'different numbers have different successors', and induction.
Gist of Idea
Peano Arithmetic can have three second-order axioms, plus '1' and 'successor'
Source
E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §2)
A Reaction
This is 'second-order' Peano Arithmetic, though it is at least as common to formulate in first-order terms (only quantifying over objects, not over properties - as is done here in the induction axiom). I like the use of '1' as basic instead of '0'!
| 18841 | Categoricity implies that Dedekind has characterised the numbers, because it has one domain [Rumfitt on Dedekind] |
| 10833 | Many concepts can only be expressed by second-order logic [Boolos] |
| 10294 | Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
| 10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
| 17899 | Second-order induction is stronger as it covers all concepts, not just first-order definable ones [George/Velleman] |
| 10674 | A plural language gives a single comprehensive induction axiom for arithmetic [Hossack] |