12 ideas
| 10882 | Predicative definitions only refer to entities outside the defined collection [Horsten] |
| Full Idea: Definitions are called 'predicative', and are considered sound, if they only refer to entities which exist independently from the defined collection. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §2.4) |
| 19389 | Truth is a characteristic of possible thoughts [Leibniz] |
| Full Idea: Truth really belongs to the class of thoughts which are possible. | |
| From: Gottfried Leibniz (Dialogue on Things and Words [1677], p.7) | |
| A reaction: I like the fact that this ties truth to 'thoughts', rather than peculiar abstract unthought entities called 'propositions', but I take it that thoughts which are possible but not thought will thereby not exist, so they can't be true. |
| 19388 | True and false seem to pertain to thoughts, yet unthought propositions seem to be true or false [Leibniz] |
| Full Idea: B: I concede that truth and falsity both pertain to thoughts and not to things. A: But this contradicts your previous opinion that a proposition remains true even when you are not thinking about it. | |
| From: Gottfried Leibniz (Dialogue on Things and Words [1677], p.7) | |
| A reaction: I don't trigger the truth of a proposition by thinking about it - I see that it is true. But I dislike the idea that reality is full of propositions, which seems to be mad metaphysics. So I deny unthought propositions are true, because there aren't any. |
| 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) |
| 10884 | A theory is 'categorical' if it has just one model up to isomorphism [Horsten] |
| Full Idea: If a theory has, up to isomorphism, exactly one model, then it is said to be 'categorical'. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §5.2) |
| 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) |
| 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] |
| 10885 | Computer proofs don't provide explanations [Horsten] |
| Full Idea: Mathematicians are uncomfortable with computerised proofs because a 'good' proof should do more than convince us that a certain statement is true. It should also explain why the statement in question holds. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §5.3) |
| 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) |
| 10881 | The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten] |
| Full Idea: The notion of an ordinal number is a set-theoretic, and hence non-arithmetical, concept. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §2.3) |