display all the ideas for this combination of texts
3 ideas
| 10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
| Full Idea: Second-order arithmetic is categorical - indeed, there is a single formula of second-order logic whose only model is the standard model ω, consisting of just the natural numbers, with all of arithmetic following. It is nevertheless incomplete. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) | |
| A reaction: This is the main reason why second-order logic has a big fan club, despite the logic being incomplete (as well as the arithmetic). |
| 10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
| Full Idea: Second-order arithmetic can rule out the non-standard models (with non-standard numbers). Its induction axiom crucially refers to 'any' property, which gives the needed categoricity for the models. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) |
| 10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
| Full Idea: The Von Neumann numbers have a structural isomorphism to the natural numbers - each number is the set of all its predecessors, so 2 is the set of 0 and 1. This helps proofs, but is unacceptable. 2 is not a set with two members, or a member of 3. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.4) |