11 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) |
| 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) |
| 16886 | The truth of an axiom must be independently recognisable [Frege] |
| Full Idea: It is part of the concept of an axiom that it can be recognised as true independently of other truths. | |
| From: Gottlob Frege (On Euclidean Geometry [1900], 183/168), quoted by Tyler Burge - Frege on Knowing the Foundations 4 | |
| A reaction: Frege thinks the axioms of arithmetic all reside in logic. |
| 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) |