18 ideas
| 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
| Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro) |
| 17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
| Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1) |
| 23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
| Full Idea: Naïve set theory is based on the principles that any formula defines a set, and that coextensive sets are identical. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 4.2) | |
| A reaction: The second principle is a standard axiom of ZFC. The first principle causes the trouble. |
| 23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
| Full Idea: In classical semantics the function of singular terms is to refer, and that of quantifiers, to range over appropriate domains of entities. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 7.1) |
| 23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
| Full Idea: Considered in isolation, the axioms of group theory are not assertions but comprise an implicit definition of some abstract structure, | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 3.5) | |
| A reaction: The traditional Euclidean approach is that axioms are plausible assertions with which to start. The present idea sums up the modern approach. In the modern version you can work backwards from a structure to a set of axioms. |
| 23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
| Full Idea: Mathematics investigates the deductive consequences of axiomatic theories, but it also needs its own foundational axioms in order to provide models for its various axiomatic theories. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 4.1) | |
| A reaction: This is a problem which faces the deductivist (if-then) approach. The deductive process needs its own grounds. |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| Full Idea: There is at present no solid argument to the effect that a given statement is absolutely undecidable. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 5.3) |
| 13412 | Obtaining numbers by abstraction is impossible - there are too many; only a rule could give them, in order [Benacerraf] |
| Full Idea: Not all numbers could possibly have been learned à la Frege-Russell, because we could not have performed that many distinct acts of abstraction. Somewhere along the line a rule had to come in to enable us to obtain more numbers, in the natural order. | |
| From: Paul Benacerraf (Logicism, Some Considerations (PhD) [1960], p.165) | |
| A reaction: Follows on from Idea 13411. I'm not sure how Russell would deal with this, though I am sure his account cannot be swept aside this easily. Nevertheless this seems powerful and convincing, approaching the problem through the epistemology. |
| 13413 | We must explain how we know so many numbers, and recognise ones we haven't met before [Benacerraf] |
| Full Idea: Both ordinalists and cardinalists, to account for our number words, have to account for the fact that we know so many of them, and that we can 'recognize' numbers which we've neither seen nor heard. | |
| From: Paul Benacerraf (Logicism, Some Considerations (PhD) [1960], p.166) | |
| A reaction: This seems an important contraint on any attempt to explain numbers. Benacerraf is an incipient structuralist, and here presses the importance of rules in our grasp of number. Faced with 42,578,645, we perform an act of deconstruction to grasp it. |
| 13411 | If numbers are basically the cardinals (Frege-Russell view) you could know some numbers in isolation [Benacerraf] |
| Full Idea: If we accept the Frege-Russell analysis of number (the natural numbers are the cardinals) as basic and correct, one thing which seems to follow is that one could know, say, three, seventeen, and eight, but no other numbers. | |
| From: Paul Benacerraf (Logicism, Some Considerations (PhD) [1960], p.164) | |
| A reaction: It seems possible that someone might only know those numbers, as the patterns of members of three neighbouring families (the only place where they apply number). That said, this is good support for the priority of ordinals. See Idea 13412. |
| 17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
| Full Idea: Some of the standard large cardinals (in order of increasing (logical) strength) are: inaccessible, Mahlo, weakly compact, indescribable, Erdös, measurable, strong, Wodin, supercompact, huge etc. (...and ineffable). | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) | |
| A reaction: [I don't understand how cardinals can have 'logical strength', but I pass it on anyway] |
| 17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
| Full Idea: To the extent that we are justified in accepting Peano Arithmetic we are justified in accepting its consistency, and so we know how to expand the axiom system so as to overcome the limitation [of Gödel's Second Theorem]. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.1) | |
| A reaction: Each expansion brings a limitation, but then you can expand again. |
| 17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
| Full Idea: The arithmetical instances of undecidability that arise at one stage of the hierarchy are settled at the next. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) |
| 23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
| Full Idea: If the 2nd Incompleteness Theorem undermines Hilbert's attempt to use a weak theory to prove the consistency of a strong one, it is still possible to prove the consistency of one theory, assuming the consistency of another theory. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 4.6) | |
| A reaction: Note that this concerns consistency, not completeness. |
| 13415 | An adequate account of a number must relate it to its series [Benacerraf] |
| Full Idea: No account of an individual number is adequate unless it relates that number to the series of which it is a member. | |
| From: Paul Benacerraf (Logicism, Some Considerations (PhD) [1960], p.169) | |
| A reaction: Thus it is not totally implausible to say that 2 is several different numbers or concepts, depending on whether you see it as a natural number, an integer, a rational, or a real. This idea is the beginning of modern structuralism. |
| 23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
| Full Idea: Philosophical structuralism holds that mathematics is the study of abstract structures, or 'patterns'. If mathematics is the study of all possible patterns, then it is inevitable that the world is described by mathematics. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 11.1) | |
| A reaction: [He cites the physicist John Barrow (2010) for this] For me this is a major idea, because the concept of a pattern gives a link between the natural physical world and the abstract world of mathematics. No platonism is needed. |
| 23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
| Full Idea: Modern logic requires that logical truths be true in all models, including ones devoid of any mathematical objects. It follows immediately that the existence of mathematical objects can never be a matter of logic alone. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 2) | |
| A reaction: Hm. Could there not be a complete set of models for a theory which all included mathematical objects? (I can't answer that). |
| 23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
| Full Idea: Game Formalism seeks to banish all semantics from mathematics, and Term Formalism seeks to reduce any such notions to purely syntactic ones. | |
| From: Øystein Linnebo (Philosophy of Mathematics [2017], 3.3) | |
| A reaction: This approach was stimulated by the need to justify the existence of the imaginary number i. Just say it is a letter! |