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

  ##  [Semantic Tableaux](https://mathlogic.quantumdictionary.io/semantic-tableaux-0) 

  
 [![Mathematics & Logic Dictionary](/sites/default/files/styles/large/public/2026-01/Mathematics%20%26%20Logic.png.webp?itok=UhtTRPnp)](/topic-specific-dictionaries/natural-formal-sciences/mathematics-logic)

- Natural &amp; Formal Sciences -

**Mathematics &amp; Logic Dictionary**

 
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.