trees

1/27/08 10Software

Prerequisities

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

Skills to be acquired in this tutorial:

To become familiar with the notions of tree, branch, open branch, closed branch.

[The material on Trees under Howson is probably more current than this. These notes will be updated, though (Nov 2011)]

This section of the tutorials and

A.Hausman, H.Kahane, P.Tidman [2007], Logic and Philosophy

would work well together.

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

For the Tarski's World part of LP&L, a standard interpretation is used of various sized polyhedra on a chessboard. Here is a link to their screenshot of it Tarski's World.

Here we are just trying a few samples to see if the software is running correctly.

1/29/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic 

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

For the Tarski's World part of LP&L, a standard interpretation is used of various sized polyhedra on a chessboard. Here is a link to their screenshot of it Tarski's World.

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

For the Tarski's World part of LP&L, a standard interpretation is used of various sized polyhedra on a chessboard, for example,

Here we are just trying a few samples to see if the software is running correctly.

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

What follows are further Ana Con inferences.

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

What follows are further Ana Con inferences.

1/28/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

LP&L comes with a Normal or Standard Interpretation, and this certainly affects how trees should and can behave.

For example, the polyhedra are either tetrahedra, cubes, or dodecahedra. If a particular polyhedron is a cube it cannot be a tetrahedron, so Cube(a)&Tet(a) cannot be true and a branch containing Cube(a) and Tet(a) should close or be able to close.

1/29/2020

Reading

John Barwise and John Etchemendy, [1999] Language, Proof and Logic

For the Tarski's World part of LP&L, a standard interpretation is used of various sized polyhedra on a chessboard. Here is a link to some information about it Tarski's World.