9 ideas
| 9786 | Philosophers working like teams of scientists is absurd, yet isolation is hard [Cartwright,R] |
| Full Idea: The notion that philosophy can be done cooperatively, in the manner of scientists or engineers engaged in a research project, seems to me absurd. And yet few philosophers can survive in isolation. | |
| From: Richard Cartwright (Intro to 'Philosophical Essays' [1987], xxi) | |
| A reaction: This why Nietzsche said that philosophers were 'rare plants'. |
| 9784 | A false proposition isn't truer because it is part of a coherent system [Cartwright,R] |
| Full Idea: You do not improve the truth value of a false proposition by calling attention to a coherent system of propositions of which it is one. | |
| From: Richard Cartwright (Intro to 'Philosophical Essays' [1987], xi) | |
| A reaction: We need to disentangle the truth-value from the justification here. If it is false, then we can safely assume that is false, but we are struggling to decide whether it is false, and we want all the evidence we can get. Falsehood tends towards incoherence. |
| 1403 | A rational donkey would starve to death between two totally identical piles of hay [Buridan, by PG] |
| Full Idea: A rational donkey faced with two totally identical piles of hay would be unable to decide which one to eat first, and would therefore starve to death | |
| From: report of Jean Buridan (talk [1338]) by PG - Db (ideas) | |
| A reaction: also De Caelo 295b32 (Idea 19740). |
| 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) |