Formal System Soundness

A Formal System Soundness is a Formal System's Property that is logically valid with respect to the system's formal semantics.

• AKA: Soundness.
• Context:
  • It can range from being a Formal System Weak Soundness to being Formal System Strong Soundness.
  • …
• Example(s):
  • a Logical System Soundness,
  • a Deductive System Soundness,
  • an Arithmetic Soundness.
  • …
• Counter-Example(s):
  • a Logical System Completeness,
  • a Deductive System Completeness.
• See: Truth, Mathematical Logic, Logical System, if And Only if, Formula (Mathematical Logic), Formal Semantics (Logic), Converse (Logic)#Categorical Converse, Completeness (Logic).

---

---

References

2020

• (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/Soundness Retrieved:2020-1-9.
  • In mathematical logic, a logical system has the soundness property if and only if every formula that can be proved in the system is logically valid with respect to the semantics of the system.

    The converse of soundness is known as completeness. In most cases, this comes down to its rules having the property of preserving truth (...)

    ----