Definition:Semantic Tableau/Completed
Jump to navigation
Jump to search
Definition
Let $T$ be a semantic tableau.
Then $T$ is completed if and only if all of its leaves are marked.
Also see
Sources
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): $\S 2.6.2$: Definition $2.65$