Mathematical logic and foundations Definition
Soundness
Builds on Logical consequenceHilbert system
Definition
Let be the derivability relation of a proof system, such as a Hilbert system. Let be logical consequence for the same language. The proof system is sound if implies , for every set of formulas and every formula . It is weakly sound if implies for every formula .
Remarks
The standard Hilbert system for propositional logic is sound. Each axiom is a tautology, checked by a truth table, and modus ponens preserves truth under every assignment. Induction on the length of a derivation then gives soundness. Adding the rule "from and , infer " gives an unsound system. With it, , but the assignment , shows . The converse property, that implies , is completeness. For first-order logic it is Gödel's completeness theorem.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Hilbert system concept
- Logical consequence concept
- Soundness definition
Further reading
About this page
| Tag | 5PP333WZEK |
|---|---|
| URI | m2://5PP333WZEK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B05, 03B10, 03F03 |
| Defines | Soundness |
| Uses | Logical consequence, Hilbert system |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.
What links here
No page links to this page yet.