9 ideas
| 19695 | The devil was wise as an angel, and lost no knowledge when he rebelled [Whitcomb] |
| Full Idea: The devil is evil but nonetheless wise; he was a wise angel, and through no loss of knowledge, but, rather, through some sort of affective restructuring tried and failed to take over the throne. | |
| From: Dennis Whitcomb (Wisdom [2011], 'Argument') | |
| A reaction: ['affective restructuring' indeed! philosophers- don't you love 'em?] To fail at something you try to do suggests a flaw in the wisdom. And the new regime the devil wished to introduce doesn't look like a wise regime. Not convinced. |
| 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) |
| 13827 | Logical consequence isn't a black box (Tarski's approach); we should explain how arguments work [Prawitz] |
| Full Idea: Defining logical consequence in the way Tarski does is a rather meagre result, treating an argument as a black box, observing input and output, while disregarding inner structure. We should define logical consequence on the basis of valid arguments. | |
| From: Dag Prawitz (On the General Idea of Proof Theory [1974], §2) |
| 13826 | Model theory looks at valid sentences and consequence, but not how we know these things [Prawitz] |
| Full Idea: In model theory, which has dominated the last decades, one concentrates on logically valid sentences, and what follows logically from what, but one disregards questions concerning how we know these things. | |
| From: Dag Prawitz (On the General Idea of Proof Theory [1974], §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) |