10 ideas
| 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. |
| 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. |
| 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! |
| 3193 | Turing showed that logical rules can be specified computationally and mechanically [Turing, by Rey] |
| Full Idea: Turing showed that any formal process can be specified computationally, and captured by a Turing Machine. Hence logical rules (and arithmetic) could be obeyed not by someone representing and following them, but by causal organisation of the brain. | |
| From: report of Alan Turing (works [1935]) by Georges Rey - Contemporary Philosophy of Mind 8.2 | |
| A reaction: It is questionable whether logic is an entirely formal process, if it involves truth. You would need an entirely formal notion of truth for that. But a brain can do whatever a flow diagram can do. |
| 6017 | Nomos is king [Pindar] |
| Full Idea: Nomos is king. | |
| From: Pindar (poems [c.478 BCE], S 169), quoted by Thomas Nagel - The Philosophical Culture | |
| A reaction: This seems to be the earliest recorded shot in the nomos-physis wars (the debate among sophists about moral relativism). It sounds as if it carries the full relativist burden - that all that matters is what has been locally decreed. |