trees

---

 

∃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, a chosen

11/4/2020

Under construction

You'd want to check out the respective formation rules, to see what is a well formed formula, and what a variable, etc.

Then the tree rules are:-

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.

---

 

∃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, a chosen

---

 

∃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, a chosen

2/3/08 10 Software

Quiz 2 Applet

Your browser is not displaying the Deriver applet. Try downloading Deriver itself by clicking on the link elsewhere on the page.

 

11/4/08 10Software

Skills to be acquired in this tutorial:

To become familiar with the new rules for predicate logic trees.

Reading

M.Bergmann, J.Moor, J.Nelson, [2004] The Logic Book Chapter 9

Tutorial:

Introduction

There are further rules for predicate logic trees (which we will come to shortly).

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