default
Reading a Counter Example from the Tree
martin
Wed, 06/20/2012 - 22:29
Topic
Logical System
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
Review of Tree Propositional Rules
martin
Sat, 06/02/2012 - 16:35
Topic
Logical System
6/2/12
Review of Tree Propositional Rules, shown as patterns
Here the letters 'P' and 'Q' are being used to stand for entire well formed formulas (so, on a particular occasion, 'P' might stand for the atomic formula 'F' and, on another occasion, it might stand for the compound formula 'F&G').
Tree Predicate Exercises: Roll your own
martin
Sat, 06/02/2012 - 11:40
Topic
Logical System
Review of Tree Predicate Rules
martin
Sat, 06/02/2012 - 11:39
Topic
Logical System
∃D. The constant, a, must be new to the branch [here the computer will choose for you]
∀D. Any closed term, stage 1, your choice
∀D. Any closed term, stage 2, the constant 'a' chosen
Set Theory (and Russell's Paradox)
martin
Thu, 05/31/2012 - 14:55
Topic
Logical System