11 ideas
| 10163 | Propositional modal logic has been proved to be complete [Kripke, by Feferman/Feferman] |
| Full Idea: At the age of 19 Saul Kripke published a completeness proof of propositional modal logic. | |
| From: report of Saul A. Kripke (A Completeness Theorem in Modal Logic [1959]) by Feferman / Feferman - Alfred Tarski: life and logic Int V |
| 10760 | With possible worlds, S4 and S5 are sound and complete, but S1-S3 are not even sound [Kripke, by Rossberg] |
| Full Idea: Kripke gave a possible worlds semantics to a whole range of modal logics, and S4 and S5 turned out to be both sound and complete with this semantics. Hence more systems could be designed. S1-S3 failed in soundness, leading to 'impossible worlds'. | |
| From: report of Saul A. Kripke (A Completeness Theorem in Modal Logic [1959]) by Marcus Rossberg - First-order Logic, 2nd-order, Completeness §4 |
| 16189 | The variable domain approach to quantified modal logic invalidates the Barcan Formula [Kripke, by Simchen] |
| Full Idea: Kripke's variable domain approach to quantified modal logic famously invalidates the Barcan Formula. | |
| From: report of Saul A. Kripke (A Completeness Theorem in Modal Logic [1959]) by Ori Simchen - The Barcan Formula and Metaphysics §3 | |
| A reaction: [p.9 and p.16] In a single combined domain all the possibilia must be present, but with variable domains objects in remote domains may not exist in your local domain. BF is committed to those possible objects. |
| 15132 | The Barcan formulas fail in models with varying domains [Kripke, by Williamson] |
| Full Idea: Kripke showed that the Barcan formula ∀x□A⊃□∀xA and its converse fail in models which require varying domains. | |
| From: report of Saul A. Kripke (A Completeness Theorem in Modal Logic [1959]) by Timothy Williamson - Truthmakers and Converse Barcan Formula §1 | |
| A reaction: I think this is why I reject the Barcan formulas for metaphysics - because the domain of metaphysics should be seen as varying, since some objects are possible in some contexts and not in others. Hmm… |
| 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) |
| 20716 | False prophets will perform wonders to deceive even the elect [Mark] |
| Full Idea: For false messiahs and false prophets will appear and perform signs and wonders to deceive, if possible, even the elect. | |
| From: St Mark (02: Gospel of St Mark [c.66], 13:22), quoted by Brian Davies - Introduction to the Philosophy of Religion | |
| A reaction: This casts a rather different light on the miracles of Jesus, since they were performed in a context in which even Jesus believed that lots of people (and not just the son of God) could perform miracles. Undermines any Argument from Miracles. |