Combining Texts

All the ideas for 'A Completeness Theorem in Modal Logic', 'On Divination ('De divinatione')' and 'The Case against Closure (and reply)'

expand these ideas     |    start again     |     specify just one area for these texts


12 ideas

4. Formal Logic / D. Modal Logic ML / 1. Modal Logic
Propositional modal logic has been proved to be complete [Kripke, by Feferman/Feferman]
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]
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]
The Barcan formulas fail in models with varying domains [Kripke, by Williamson]
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / c. Knowledge closure
Closure says if you know P, and also know P implies Q, then you must know Q [Dretske]
We needn't regret the implications of our regrets; regretting drinking too much implies the past is real [Dretske]
Reasons for believing P may not transmit to its implication, Q [Dretske]
Knowing by visual perception is not the same as knowing by implication [Dretske]
The only way to preserve our homely truths is to abandon closure [Dretske]
P may imply Q, but evidence for P doesn't imply evidence for Q, so closure fails [Dretske]
We know past events by memory, but we don't know the past is real (an implication) by memory [Dretske]
16. Persons / F. Free Will / 6. Determinism / a. Determinism
Whoever knows future causes knows everything that will be [Cicero]