10 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) |
| 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) |
| 9226 | If mathematical theories conflict, it may just be that they have different subject matter [Field,H] |
| Full Idea: Unlike logic, in the case of mathematics there may be no genuine conflict between alternative theories: it is natural to think that different theories, if both consistent, are simply about different subjects. | |
| From: Hartry Field (Recent Debates on the A Priori [2005], 7) | |
| A reaction: For this reason Field places logic at the heart of questions about a priori knowledge, rather than mathematics. My intuitions make me doubt his proposal. Given the very simple basis of, say, arithmetic, I would expect all departments to connect. |
| 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) |
| 13230 | Particular essence is often captured by generality [Steiner,M] |
| Full Idea: Generality is often necessary for capturing the essence of a particular. | |
| From: Mark Steiner (Mathematical Explanation [1978], p.36) | |
| A reaction: The most powerful features of an entity are probably those which are universal, like intelligence or physical strength in a human. Those characteristics are powerful because they compete with the same characteristic in others (perhaps?). |
| 13229 | Maybe an instance of a generalisation is more explanatory than the particular case [Steiner,M] |
| Full Idea: Maybe to deduce a theorem as an instance of a generalization is more explanatory than to deduce it correctly. | |
| From: Mark Steiner (Mathematical Explanation [1978], p.32) | |
| A reaction: Steiner eventually comes down against this proposal, on the grounds that some proofs are too general, and hence too far away from the thing they are meant to explain. |
| 13231 | Explanatory proofs rest on 'characterizing properties' of entities or structure [Steiner,M] |
| Full Idea: My proposal is that an explanatory proof makes reference to the 'characterizing property' of an entity or structure mentioned in the theorem, where the proof depends on the property. If we substitute a different object, the theory collapses. | |
| From: Mark Steiner (Mathematical Explanation [1978], p.34) | |
| A reaction: He prefers 'characterizing property' to 'essence', because he is not talking about necessary properties, since all properties are necessary in mathematics. He is, in fact, reverting to the older notion of an essence, as the core power of the thing. |