15 ideas
| 6299 | Axioms are often affirmed simply because they produce results which have been accepted [Resnik] |
| Full Idea: Many axioms have been proposed, not on the grounds that they can be directly known, but rather because they produce a desired body of previously recognised results. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.5.1) | |
| A reaction: This is the perennial problem with axioms - whether we start from them, or whether we deduce them after the event. There is nothing wrong with that, just as we might infer the existence of quarks because of their results. |
| 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) |
| 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) |
| 6304 | Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik] |
| Full Idea: Mathematical realism is the doctrine that mathematical objects exist, that much contemporary mathematics is true, and that the existence and truth in question is independent of our constructions, beliefs and proofs. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.12.9) | |
| A reaction: As thus defined, I would call myself a mathematical realist, but everyone must hesitate a little at the word 'exist' and ask, how does it exist? What is it 'made of'? To say that it exists in the way that patterns exist strikes me as very helpful. |
| 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) |
| 6300 | Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik] |
| Full Idea: In maths the primary subject-matter is not mathematical objects but structures in which they are arranged; our constants and quantifiers denote atoms, structureless points, or positions in structures; they have no identity outside a structure or pattern. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.1) | |
| A reaction: This seems to me a very promising idea for the understanding of mathematics. All mathematicians acknowledge that the recognition of patterns is basic to the subject. Even animals recognise patterns. It is natural to invent a language of patterns. |
| 6303 | Sets are positions in patterns [Resnik] |
| Full Idea: On my view, sets are positions in certain patterns. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.5) | |
| A reaction: I have always found the ontology of a 'set' puzzling, because they seem to depend on prior reasons why something is a member of a given set, which cannot always be random. It is hard to explain sets without mentioning properties. |
| 6295 | There are too many mathematical objects for them all to be mental or physical [Resnik] |
| Full Idea: If we take mathematics at its word, there are too many mathematical objects for it to be plausible that they are all mental or physical objects. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: No one, of course, has ever claimed that they are, but this is a good starting point for assessing the ontology of mathematics. We are going to need 'rules', which can deduce the multitudinous mathematical objects from a small ontology. |
| 6296 | Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik] |
| Full Idea: I argue that mathematical knowledge has its roots in pattern recognition and representation, and that manipulating representations of patterns provides the connection between the mathematical proof and mathematical truth. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: The suggestion that patterns are at the basis of the ontology of mathematics is the most illuminating thought I have encountered in the area. It immediately opens up the possibility of maths being an entirely empirical subject. |
| 6301 | Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik] |
| Full Idea: Of the equivalence relationships which occur between patterns, congruence is the strongest, equivalence the next, and mutual occurrence the weakest. None of these is identity, which would require the same position. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.3) | |
| A reaction: This gives some indication of how an account of mathematics as a science of patterns might be built up. Presumably the recognition of these 'degrees of strength' cannot be straightforward observation, but will need an a priori component? |
| 6302 | Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik] |
| Full Idea: An objection is that structuralism fails to explain why certain mathematical patterns are unified wholes while others are not; for instance, some think that an ontological account of mathematics must explain why a triangle is not a 'random' set of points. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.4) | |
| A reaction: This is an indication that we are not just saying that we recognise patterns in nature, but that we also 'see' various underlying characteristics of the patterns. The obvious suggestion is that we see meta-patterns. |
| 7566 | The Identity of Indiscernibles is really the same as the verification principle [Jolley] |
| Full Idea: Various writers have noted that the Identity of Indiscernibles is really tantamount to the verification principle. | |
| From: Nicholas Jolley (Leibniz [2005], Ch.3) | |
| A reaction: Both principles are false, because they are the classic confusion of epistemology and ontology. The fact that you cannot 'discern' a difference between two things doesn't mean that there is no difference. Things beyond verification can still be discussed. |