Definition:Confutation
From ProofWiki
Definition
Let $\mathbf H$ be a set of WFFs of propositional calculus.
A confutation (or tableau confutation) of $\mathbf H$ is a finite propositional tableau $T$ with root $\mathbf H$ such that every branch of $T$ is contradictory.
If $\mathbf H = \left\{{\mathbf A}\right\}$ is a singleton set, then a confutation of $\mathbf H$ can be referred to as a confutation of $\mathbf A$.
A confutation is always a finished tableau because every branch is finite and contradictory.
Sources
- H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability (1996): $\S 1.7$: Definition $1.7.4$
