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.
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
10/7/09
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
7/27/08 10 Software
None really: this is merely to give you a whiff of the topic of trees for modal logic.
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.
10/7/09
There are the ordinary (non-modal) tree propositional rules plus
The Modal Negation (MN) rules
Rod Girle [2000] Modal Logics and Philosophy Chapter 3
S4 has the rules
{Non-modal propositional rules + Modal Negation + ◊R + □R+ □T+□□R}
These are described in Review of S4 Rules.
The extra rule (over T) is the Rule □□R and what it allows you to do it this. Without it (but with the other rules) you could reason from
□F (n)
10/7/09 10Software
Rod Girle [2000] Modal Logics and Philosophy Chapter 3
T has the rules
{Non-modal propositional rules + Modal Negation + ◊R + □R+ □T}
These are described in Review of T Rules.