## Review of K Propositional Rules

**There are the ordinary (non-modal) tree propositional rules plus **

**The Modal Negation (MN) rules**

Tree Tutorial 8 Modal Trees
martin
Wed, 07/26/2017 - 12:37
###### 1/31/20

### Reading

### Tutorial

Topic

Logical System

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.

[Modal logic is a vast area, what is being presented here is the briefest of glimpses through the shop window (a book like the Girle would help you go further).]

The Reading a Counter Example from a Tree Widget
martin
Sat, 01/04/2014 - 21:34
## Exercise: Finding a counter-example.

Topic

Logical System

Help with Reading a Counter Example [Generic]
martin
Sun, 03/31/2013 - 13:50
### Reading a counter example from an open branch

Topic

2013

*[This is a Quicktime Movie, click the Play button to view it. The logical symbols you see in use may be different to the ones you are familiar with (sorry about that, but it is not practical to produce different movies for all the minor variations in symbols). Any differences will not affect the principles being explained here.] *

Your browser does not support html5 video.

The Tree Widget
martin
Fri, 03/01/2013 - 20:04
### An example of the tree widget in use (and we are showing a different parser here to the earlier ones)

Topic

2013

The logical symbols in use are ¬ ∧ ∨ → ↔ ∀ ∃ .

Determine whether these arguments are valid (ie try to produce closed trees for them)

a) ∀x(F(x)→G(x)), ∃x¬G(x) ∴ ∃x¬F(x)

b) ∀x(F(x)→∀yG(y)), F(a) ∴ ∀xG(x)

c) ∀x(A(x)→B(x)), ∀x(¬A(x)→C(x))∴ ∀x(¬B(x)→¬C(x))

d) ∃xF(x),∀x(¬G(x)→¬F(x)),∀xM(x) ∴ ∃xG(x)∧∃xM(x)

Reading a Counter Example from the Tree
martin
Wed, 06/20/2012 - 22:29
###### Last altered 6/20/12

A central use for Trees is to produce a counter example to an invalid argument. To do this, you construct a tree with a complete open branch. You will be able to do this for invalid arguments (but not valid ones). Then you run up that branch assigning all atomic formulas True and all negations of atomic formulas False.

## Exercise: Finding a counter-example.

Topic

Logical System

This software will let you try a few.

Logical System

**There are the ordinary (non-modal) tree propositional rules plus **

**The Modal Negation (MN) rules**

Logical System

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
###### 6/3/12

Topic

Logical System

You can try your own exercises here.

Here are a few hints

- You have to use the right (unicode/html) logical symbols. Check Writing symbols
- The symbols in use here are ~ & ∨ →
≡

Review of Tree Predicate Rules
martin
Sat, 06/02/2012 - 11:39

####

####
∃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

Topic

Logical System