9 ideas
| 9184 | We can't presume that all interesting concepts can be analysed [Williamson] |
| Full Idea: We have no prior reason to suppose that philosophically significant concepts have interesting analyses into necessary and sufficient conditions. | |
| From: Timothy Williamson (Review of Bob Hale's 'Abstract Objects' [1988]) | |
| A reaction: We might think that they are either analysable or primitive, and that failure of analysis invites us to take a concept as primitive. But maybe God can analyse it and we can't. |
| 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) |
| 9183 | Platonism claims that some true assertions have singular terms denoting abstractions, so abstractions exist [Williamson] |
| Full Idea: The Fregean argument for platonism is that some true assertions contain singular terms which denote abstract objects if they denote anything; since the assertions are true, the singular terms denote. | |
| From: Timothy Williamson (Review of Bob Hale's 'Abstract Objects' [1988]) | |
| A reaction: I am perplexed that anyone would rest their view of reality on such an argument. The obvious comparison would be with true remarks about blatantly fictional characters, or blatantly invented concepts such as 'checkmate'. |
| 2975 | That honey is sweet I do not affirm, but I agree that it appears so [Timon] |
| Full Idea: That honey is sweet I do not affirm, but I agree that it appears so. | |
| From: Timon (On Sensations (frags) [c.285 BCE]), quoted by Diogenes Laertius - Lives of Eminent Philosophers 09.104-5 |