Review of K Propositional Rules
Logical System
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
modal
Review of Additional S5 Propositional Rules
Logical System
 |
 |
◊ S5 world, k, must be new [here the computer will choose for you] | |
Running the Deriver Application in a web browser using CheerpJ
8/10/2026
It has become a challenge to run the legacy Deriver application, which was written in Java Swing, simply because few Users have Java on their computers. Fortunately, Leaning Technologies have devised some technology, CheerpJ, that allow Java Swing applications to run in a web browser.
Review of K Propositional Rules
Logical System
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
Review of Additional S5 Propositional Rules
Logical System
◊ S5 world, k, must be new [here the computer will choose for you]
□ S5 any world, stage 1, your choice
S4 Propositional Rules
Logical System
10/7/09
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
K Propositional Rules
Logical System
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
Additional S5 Propositional Rules
Logical System
◊ S5 world, k, must be new [here the computer will choose for you]
The Tree Applet for Modal Trees
7/27/08 10 Software
Skills to be acquired in this tutorial:
None really: this is merely to give you a whiff of the topic of trees for modal logic.
Reading
Colin Howson, [1997] Logic with trees Chapter 12 Section 2
The Howson [1997] does not expand on modal logic (and modal trees) so a text like
Rod Girle [2000] Modal Logics and Philosophy
would definitely be a help here.
Review of S4 Propositional Rules
Logical System
10/7/09
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules