8 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) |
| 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) |
| 18436 | Entities are truthmakers for their resemblances, so no extra entities or 'resemblances' are needed [Rodriquez-Pereyra] |
| Full Idea: A and B are the sole truthmakers for 'A and B resemble each other'. There is no need to postulate extra entities - the resembling entities suffice to account for them. There is no regress of resemblances, ...since there are no resemblances at all. | |
| From: Gonzalo Rodriguez-Pereyra (Resemblance Nominalism: a solution to universals [2002], p.115), quoted by Douglas Edwards - Properties 5.5.2 | |
| A reaction: This seems to flatly reject the ordinary conversational move of asking in what 'respect' the two things resemble, which may be a genuine puzzle which gets an illuminating answer. We can't fully explain resemblance, but we can do better than this! |
| 23996 | Akrasia is intelligible in hindsight, when we revisit our previous emotions [Blackburn] |
| Full Idea: To make my emotion intelligible [in a weakness of will case] is to look back and recognise that my emotions and dispositions were not quite as I had taken them to be. It is quite useless in such a case to invoke a blanket diagnosis of 'irrationality'. | |
| From: Simon Blackburn (Ruling Passions [1998], p.191) | |
| A reaction: So Blackburn rejects the idea of akrasia, because there was never really a conflict. He says rational people always aim to maximise their utility (p.135), and if their own act surprises them, it is just a failure to understand their own rationality. |