trees

Tree Quiz 1.

2/3/08 10 Software. The Widget for this has yet to be written. 2013

However, the Tree Quiz can be done in the web application. Launch the web application from here Deriver [Howson] — username 'logic' password 'logic'.

Preferences

You will need the relevant Preferences for this.

• Set gamesMenu to true; and  you can check that the parser is set to Howson.

2013

Reading

Colin Howson, [1997] Logic with trees Chapter 2

Exercises

Howson [1997] has a number of exercises. Many of them you will be able to do in the Widget below.

You can also try material of your own.

Here are a few hints

2013

Skills to be acquired in this tutorial:

To become familiar with the notions of closed and complete trees. To be able to use trees to test for satisfiability and invalidity.

Reading

Colin Howson, [1997] Logic with trees Chapter 2

Tutorial:

Closure and completeness

In Tutorial 1, we met the notions of closed and open branches (a closed branch was one containing a formula and also the negation of that formula, an open branch was a branch that was not closed).

Beginning Trees

2/10/08

A Simple Tree

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

2013

Tree Tutorial 2 More Rules

12/12/2020

Skills to be acquired in this tutorial:

To become familiar with the rules for propositional truth trees.

Reading

Colin Howson, [1997] Logic with trees Chapter 2

Tutorial:

Truth Tree Rules

Trees are going to be used to 'picture' the truth conditions or requirements for a formula (then, as the technique is developed, for several formulas at once).

Tree Tutorial 1 Propositional Logic Truth Trees: Introduction

12/12/2020

Prerequisities

You need to know some propositional logic to be able to understand this. In particular, you need to know about the symbols used in propositional logic, truth tables, satisfiability, consistency, and semantic invalidity (by counter example). You do not need to know propositional rules of inference and derivations. [The tutorials on propositional logic elsewhere on this site give the required background. Alternatively

2013

This section of the tutorials and

Colin Howson, [1997] Logic with trees ISBN: 0-415-13341-6

would work well together.

You need to know some propositional logic to be able to understand the tutorials to come. In particular, you need to know about the symbols used in propositional logic, truth tables, satisfiability, consistency, and semantic invalidity (by counter example). You do not need to know propositional rules of inference and derivations.

Howson [1997] will give you enough background.