##  [Semantic Tableaux](/semantic-tableaux-0) 

 Definition

A refutation-driven proof procedure that decomposes logical formulas into a tree of simpler components (a tableau or truth tree) to test satisfiability; a closed tableau (all branches contradictory) shows unsatisfiability of the root formula.

 

 

 

 

 

 





## Principle

Principle

Systematically apply decomposition rules that reflect the semantic conditions of connectives and quantifiers, expanding branches until they either close by contradiction or remain open witnesses of satisfaction.

 

 

 

 

 





## Demonstration

Demonstration

To test ¬(A ∧ B), start with its negation on the root, apply negation and conjunction decomposition to produce branches; if every branch contains a formula and its negation, the tableau closes, showing the original is valid.

 

 

 

 

## Misapplication

Misapplication

Stopping expansion prematurely, misapplying branch-splitting rules, or failing to instantiate quantifiers correctly (especially with universal quantifiers) can leave open branches falsely suggesting satisfiability or unsound closure.

 

 

 

 

 





## Consequence

Consequence

When executed correctly, tableaux provide countermodels from open branches and compact refutations from closed tableaux, making them practical for automated reasoning and diagnostic counterexample extraction.

 

 

 

 

## Reversal

Reversal

The inverted perspective is a proof system that builds derivations syntactically (e.g., Hilbert or Natural Deduction) rather than searching for semantic countermodels; tableaux emphasize model search over syntactic derivation.

 

 

 

 

 





## Boundary

Boundary

Most natural for propositional and first-order logics; first-order tableaux require care with free-variable or Skolem strategies to represent witnesses, and without restrictions the search may be non-terminating.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension exists with resolution and axiom-based calculi: tableaux are model-search oriented and tend to produce countermodels, while resolution focuses on clause refutation via unification and generation of resolvents.

 

 

 

 

 





## Synthesis

Synthesis

Semantic tableaux are a tree-based decision/search method that decomposes formulas by semantic rules into branches whose closure patterns decide satisfiability and provide explicit countermodels or refutations.