Combining Philosophers

Ideas for Herodotus, Benjamin Lee Whorf and Saul A. Kripke

unexpand these ideas     |    start again     |     choose another area for these philosophers

display all the ideas for this combination of philosophers


6 ideas

4. Formal Logic / D. Modal Logic ML / 1. Modal Logic
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
Kripke's modal semantics presupposes certain facts about possible worlds [Kripke, by Zalta]
     Full Idea: Kripke's modal semantics presupposes that worlds are maximal and consistent, that there is a unique actual world, and that worlds are coherent (e.g. lack contradiction, obey conjunction).
     From: report of Saul A. Kripke (Naming and Necessity lectures [1970]) by Edward N. Zalta - Deriving Kripkean Claims with Abstract Objects
Possible worlds allowed the application of set-theoretic models to modal logic [Kripke]
     Full Idea: The main and the original motivation for the 'possible worlds analysis' - and the way it clarified modal logic - was that it enabled modal logic to be treated by the same set theoretic techniques of model theory used successfully in extensional logic.
     From: Saul A. Kripke (Naming and Necessity preface [1980], p.19 n18)
     A reaction: So they should be ascribed the same value that we attribute to classical model theory, whatever that is.
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / a. Systems of modal logic
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
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
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.
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…