You have 3 free guides left 😟
Unlock your guides
You have 3 free guides left 😟
Unlock your guides

13.2 Soundness of Deductive Systems

2 min readaugust 7, 2024

in deductive systems is all about making sure our logical arguments hold water. It's like checking if our reasoning is airtight - not just following the rules, but also starting with true facts.

This concept builds on what we've learned about formal systems. It helps us see if our logical tools are reliable for proving things and if we can trust the conclusions we reach using them.

Soundness and Validity

Properties of Sound and Valid Arguments

Top images from around the web for Properties of Sound and Valid Arguments
Top images from around the web for Properties of Sound and Valid Arguments
  • Soundness is a property of arguments where the conclusion necessarily follows from the premises and all the premises are true
  • is a property of arguments where the conclusion necessarily follows from the premises, regardless of whether the premises are true or false
  • A is a formula that is always true, regardless of the truth values of its atomic propositions (p¬pp \lor \neg p)
  • means that if an argument is valid and all its premises are true, then its conclusion must also be true

Relationship between Soundness and Validity

  • Soundness implies validity, but validity does not imply soundness
  • An argument can be valid but unsound if one or more of its premises are false (valid form but false premise)
  • For an argument to be sound, it must be valid and have all true premises
  • A sound argument always leads to a true conclusion, while a valid argument with false premises can lead to a false conclusion

Deductive Systems and Proofs

Characteristics of Deductive Systems

  • A is a formal system consisting of a set of and that allow for the derivation of theorems
  • Axioms are statements accepted as true without , serving as the starting points for deriving other truths (A(BA)A \rightarrow (B \rightarrow A))
  • Inference rules specify how new formulas can be derived from existing ones, such as (A,ABB\frac{A, A \rightarrow B}{B})
  • Deductive systems are used to prove theorems and establish the logical consequences of a set of axioms

Proofs and Logical Consequence

  • A proof is a sequence of formulas, each of which is either an axiom or derived from previous formulas using inference rules
  • The final formula in a proof is called a , which is a of the axioms and inference rules
  • A formula BB is a logical consequence of a set of formulas Γ\Gamma if and only if there is a proof of BB from Γ\Gamma (ΓB\Gamma \vdash B)
  • Logical consequence captures the idea that the truth of the conclusion follows necessarily from the truth of the premises in a valid argument
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.


© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.

© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.
Glossary
Glossary