more from this thinker | more from this text
Full Idea
The truth trees method for establishing the validity of arguments and formulas is easy to use, and has the advantage that if an argument or formula is not valid, then a counter-example can be retrieved from the tree.
Gist of Idea
If an argument is invalid, a truth tree will indicate a counter-example
Source
Rod Girle (Modal Logics and Philosophy [2000], 1.4)
Book Ref
Girle,Rod: 'Modal Logics and Philosophy' [Acumen 2000], p.8
Related Idea
Idea 13613 A completed open branch gives an interpretation which verifies those formulae [Bostock]
| 13611 | Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock] |
| 13612 | Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock] |
| 13613 | A completed open branch gives an interpretation which verifies those formulae [Bostock] |
| 13756 | A tree proof becomes too broad if its only rule is Modus Ponens [Bostock] |
| 13757 | Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock] |
| 13762 | Tableau rules are all elimination rules, gradually shortening formulae [Bostock] |
| 13761 | In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock] |
| 7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |