display all the ideas for this combination of texts
11 ideas
| 13949 | All models of Peano axioms are isomorphic, so the models all seem equally good for natural numbers [Cartwright,R on Peano] |
| Full Idea: Peano's axioms are categorical (any two models are isomorphic). Some conclude that the concept of natural number is adequately represented by them, but we cannot identify natural numbers with one rather than another of the isomorphic models. | |
| From: comment on Giuseppe Peano (Principles of Arithmetic, by a new method [1889], 11) by Richard Cartwright - Propositions 11 | |
| A reaction: This is a striking anticipation of Benacerraf's famous point about different set theory accounts of numbers, where all models seem to work equally well. Cartwright is saying that others have pointed this out. |
| 18113 | PA concerns any entities which satisfy the axioms [Peano, by Bostock] |
| Full Idea: Peano Arithmetic is about any system of entities that satisfies the Peano axioms. | |
| From: report of Giuseppe Peano (Principles of Arithmetic, by a new method [1889], 6.3) by David Bostock - Philosophy of Mathematics 6.3 | |
| A reaction: This doesn't sound like numbers in the fullest sense, since those should facilitate counting objects. '3' should mean that number of rose petals, and not just a position in a well-ordered series. |
| 17634 | Peano axioms not only support arithmetic, but are also fairly obvious [Peano, by Russell] |
| Full Idea: Peano's premises are recommended not only by the fact that arithmetic follows from them, but also by their inherent obviousness. | |
| From: report of Giuseppe Peano (Principles of Arithmetic, by a new method [1889], p.276) by Bertrand Russell - Regressive Method for Premises in Mathematics p.276 |
| 15653 | We can add Reflexion Principles to Peano Arithmetic, which assert its consistency or soundness [Halbach on Peano] |
| Full Idea: Peano Arithmetic cannot derive its own consistency from within itself. But it can be strengthened by adding this consistency statement or by stronger axioms (particularly ones partially expressing soundness). These are known as Reflexion Principles. | |
| From: comment on Giuseppe Peano (Principles of Arithmetic, by a new method [1889], 1.2) by Volker Halbach - Axiomatic Theories of Truth (2005 ver) 1.2 |
| 17635 | Arithmetic can have even simpler logical premises than the Peano Axioms [Russell on Peano] |
| Full Idea: Peano's premises are not the ultimate logical premises of arithmetic. Simpler premises and simpler primitive ideas are to be had by carrying our analysis on into symbolic logic. | |
| From: comment on Giuseppe Peano (Principles of Arithmetic, by a new method [1889], p.276) by Bertrand Russell - Regressive Method for Premises in Mathematics p.276 |
| 21723 | The task of logicism was to define by logic the concepts 'number', 'successor' and '0' [Linsky,B] |
| Full Idea: The problem for logicism was to find definitions of the primitive notions of Peano's theory, number, successor and 0, in terms of logical notions, so that the postulates could then be derived by logic alone. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 7) | |
| A reaction: Both Frege and Russell defined numbers as equivalence classes. Successor is easily defined (in various ways) in set theory. An impossible set can exemplify zero. The trouble for logicism is this all relies on sets. |
| 21721 | Higher types are needed to distinguished intensional phenomena which are coextensive [Linsky,B] |
| Full Idea: The higher types are needed for intensional phenomena, cases where the same class is picked out by distinct propositional functions. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6.4) | |
| A reaction: I take it that in this way 'x is renate' can be distinguished from 'x is cordate', a task nowadays performed by possible worlds. |
| 21703 | Types are 'ramified' when there are further differences between the type of quantifier and its range [Linsky,B] |
| Full Idea: The types is 'ramified' because there are further differences between the type of a function defined in terms of a quantifier ranging over other functions and the type of those other functions, despite the functions applying to the same simple type. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 1) | |
| A reaction: Not sure I understand this, but it evidently created difficulties for dealing with actual mathematics, and Ramsey showed how you could manage without the ramifications. |
| 21714 | The ramified theory subdivides each type, according to the range of the variables [Linsky,B] |
| Full Idea: The original ramified theory of types ...furthern subdivides each of the types of the 'simple' theory according to the range of the bound variables used in the definition of each propositional function. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6) | |
| A reaction: For a non-intiate like me it certainly sounds disappointing that such a bold and neat theory because a tangle of complications. Ramsey and Russell in the 1920s seem to have dropped the ramifications. |
| 21713 | Did logicism fail, when Russell added three nonlogical axioms, to save mathematics? [Linsky,B] |
| Full Idea: It is often thought that Logicism was a failure, because after Frege's contradiction, Russell required obviously nonlogical principles, in order to develop mathematics. The axioms of Reducibility, Infinity and Choice are cited. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6) | |
| A reaction: Infinity and Choice remain as axioms of the standard ZFC system of set theory, which is why set theory is always assumed to be 'up to its neck' in ontological commitments. Linsky argues that Russell saw ontology in logic. |
| 21715 | For those who abandon logicism, standard set theory is a rival option [Linsky,B] |
| Full Idea: ZF set theory is seen as a rival to logicism as a foundational scheme. Set theory is for those who have given up the project of reducing mathematics to logic. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6.1) | |
| A reaction: Presumably there are other rivals. Set theory has lots of ontological commitments. One could start at the other end, and investigate the basic ontological commitments of arithmetic. I have no idea what those might be. |