13611 | Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock] |
Full Idea: A tableau proof is a proof by reduction ad absurdum. One begins with an assumption, and one develops the consequences of that assumption, seeking to derive an impossible consequence. | |
From: David Bostock (Intermediate Logic [1997], 4.1) |
13612 | Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock] |
Full Idea: Rules for semantic tableaus are of two kinds - non-branching rules and branching rules. The first allow the addition of further lines, and the second requires splitting the branch. A branch which assigns contradictory values to a formula is 'closed'. | |
From: David Bostock (Intermediate Logic [1997], 4.1) | |
A reaction: [compressed] Thus 'and' stays on one branch, asserting both formulae, but 'or' splits, checking first one and then the other. A proof succeeds when all the branches are closed, showing that the initial assumption leads only to contradictions. |
13613 | A completed open branch gives an interpretation which verifies those formulae [Bostock] |
Full Idea: An open branch in a completed tableau will always yield an interpretation that verifies every formula on the branch. | |
From: David Bostock (Intermediate Logic [1997], 4.7) | |
A reaction: In other words the open branch shows a model which seems to work (on the available information). Similarly a closed branch gives a model which won't work - a counterexample. |
13756 | A tree proof becomes too broad if its only rule is Modus Ponens [Bostock] |
Full Idea: When the only rule of inference is Modus Ponens, the branches of a tree proof soon spread too wide for comfort. | |
From: David Bostock (Intermediate Logic [1997], 6.4) |
13757 | Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock] |
Full Idea: With semantic tableaux there are recipes for proof-construction that we can operate, whereas with natural deduction there are not. | |
From: David Bostock (Intermediate Logic [1997], 6.5) |
13761 | In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock] |
Full Idea: In a tableau system no sequent is established until the final step of the proof, when the last branch closes, and until then we are simply exploring a hypothesis. | |
From: David Bostock (Intermediate Logic [1997], 7.3) | |
A reaction: This compares sharply with a sequence calculus, where every single step is a conclusive proof of something. So use tableaux for exploring proofs, and then sequence calculi for writing them up? |
13762 | Tableau rules are all elimination rules, gradually shortening formulae [Bostock] |
Full Idea: In their original setting, all the tableau rules are elimination rules, allowing us to replace a longer formula by its shorter components. | |
From: David Bostock (Intermediate Logic [1997], 7.3) |
7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |
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. | |
From: Rod Girle (Modal Logics and Philosophy [2000], 1.4) |