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

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

 

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

The Modal Negation (MN) rules

 

5/26/09 10Software

Reading

M.Bergmann, J.Moor, J.Nelson, [2008] The Logic Book Chapter 4

Exercises

Bergmann [2008] has a number of exercises. Many of them you will be able to do in the Applet below.

Here are a few hints

1/25/09

Reading a counter example from an open branch

[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.]

5/18/09 09 Software

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.

This applet will let you try a few.

Review of Sentential Tree Rules

5/18/09