more from this thinker     |     more from this text


Single Idea 13613

[filed under theme 5. Theory of Logic / H. Proof Systems / 5. Tableau Proof ]

Full Idea

An open branch in a completed tableau will always yield an interpretation that verifies every formula on the branch.

Gist of Idea

A completed open branch gives an interpretation which verifies those formulae

Source

David Bostock (Intermediate Logic [1997], 4.7)

Book Ref

Bostock,David: 'Intermediate Logic' [OUP 1997], p.177


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.

Related Idea

Idea 7790 If an argument is invalid, a truth tree will indicate a counter-example [Girle]


The 8 ideas with the same theme [proof by eliminating branches on inference trees]:

Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock]
Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock]
A completed open branch gives an interpretation which verifies those formulae [Bostock]
A tree proof becomes too broad if its only rule is Modus Ponens [Bostock]
Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock]
Tableau rules are all elimination rules, gradually shortening formulae [Bostock]
In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock]
If an argument is invalid, a truth tree will indicate a counter-example [Girle]