Mathematical logic and foundations Propositional logic Concept
Satisfiability
Summary
A formula is satisfiable when some interpretation makes it true. In propositional logic an interpretation is an assignment of truth values to the variables. In predicate logic it is a structure with an assignment of its elements to the free variables. Satisfiability is dual to validity: a formula is valid exactly when its negation is not satisfiable.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | QN7M1JCGT9 |
|---|---|
| URI | m2://QN7M1JCGT9 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B05, 03B10 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.