Definition:Finished Propositional Tableau

Definition

Let $T$ be a propositional tableau.

Then $T$ is finished if and only if every branch of $T$ is either finished or contradictory.

Also see

• Tableau Confutation is Finished

• Finished Propositional Tableau has Finished Branch or is Confutation

Sources

• 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability ... (previous) ... (next): $\S 1.10$: Completeness