Unit 1-Lecture 4：Logical & Propositions

Outline:

1 Proposition

1.1 Definition: A proposition is some fixed assertion that’s either true forever or not true forever.
1.2 Proposition from Proposition

• NOT AND OR XOR
• IMPLIES
  
  • An implication is true exactly when the if-part is false or the then-part is true.
  • False Hypothese: It often bothers people when they first learn that implications which have false hypotheses are considered to be true. But implications with false hypotheses hardly ever come up in ordinary settings, so there’s not much reason to be bothered by whatever truth assignment logicians and mathematicians choose to give them.
• IF and ONLY IF: The proposition “P if and only if Q” asserts that P and Q have the same truth value.

1.3 Notation of Composing Proposition

2 Equivalence and Validity

2.1 Truth Table: Determines the Value of Proposition.
2.2 Implication and Contropositive

• An implication and its contrapositive are equivalent.
• An implication is generally not equivalent to its converse.

2.3 Validity and Satisfiability

• A valid formula is one which is always true.
• A formula is valid iff it is equivalent to T.
• A satisfiable formula is one which can sometimes be true.

3 Algebra of Proposition

3.1 Proposition in Normal Form

• Disjunctive Normal Form (DNF)
• Conjunctive Normal Form (CNF)
• Theorem: Every propositional formula is equivalent to both a disjunctive normal form and a conjunctive normal form.

3.2 Proving Equivalences

• List of equivalence axioms
  
  • commutativity of AND/OR
  • associativity of AND/OR
  • identity for AND/OR
  • zero for AND/OR
  • idempotence for AND/OR
  • contradiction for AND/ validity for OR
  • double negation
  • DeMorgan for AND
  • DeMorgan for OR
• Theorem: Any propositional formula can be transformed into disjunctive normal form or a conjunctive normal form using the equivalences listed above.
• Theorem: Two propositional formula are equivalent iff they can be proved equivalent using the equivalence axioms listed above.

4 SAT Problem

• The general problem of deciding whether a proposition is satisfiable is called SAT.
• P or NP Problem.

---

Reference

[1] Lehman E, Leighton F H, Meyer A R. Mathematics for Computer Science[J]. 2015.