8/16/26
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.
Alternatively you could look at the first five propositional tutorials in Easy Deriver
An alternative approach to doing the exercises using the Deriver web application
Deriver can run out of a web page. In some ways this is better in that the User can print proofs, save half finished proofs etc. If you would like to try that you might want to glance at Deriver in a web page Then you can launch Deriver from here Deriver20 [Default Parser]. You'll be opening the Exercises as the Tutorials progress.
Some background on Tableaux
The use of trees (or 'tableaux') in logic was pioneered by Beth, Hintikka, and Smullyan, and their use was brought into a teaching context by such books as the standard Jeffrey text. See
E.W. Beth, [1959] The Foundations of Mathematics
G.Gentzen, [1934-5] 'Untersuchungen uber das logische Schliessen', Mathematische Zeitschrift, vol 39, 1934-5, pp.176-210, 405-31
J. Hintikka [1955] ' Two papers on Symbolic Logic', Acta Philosophica Fennica, vol 8 1955
R.C.Jeffrey, [1967] Formal Logic: Its Scope and Limits
R.M. Smullyan, [1968] First Order Logic