MorePropositionalLogicAlgebraExpressive.PDFVIP

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals • Implication: – P →Q ⇔ ¬P ∨Q – ¬(P →Q) ⇔ P ∧¬Q • Contraposition (or Transposition): – P →Q ⇔ ¬Q →¬P • Exportation: – P →(Q →R) ⇔ (P ∧Q) →R • Equivalence: – P ↔Q ⇔ (P →Q) ∧(Q →P) – P ↔Q ⇔ (P ∧Q) ∨(¬P ∧¬Q) Some More Equivalences • Distribution: – P →(Q ∧R) ⇔(P →Q) ∧(P →R) – P →(Q ∨R) ⇔(P →Q) ∨(P →R) – (P ∨Q) →R ⇔(P →R) ∧(Q →R) – (P ∧Q) →R ⇔(P →R) ∨(Q →R) (this last one is a good example of the paradox of material implication!) Also: • Conditional Reduction: P →P ⇔⊤ – (P →Q) ∧P ⇔P ∧Q P →¬P ⇔¬P – (P →Q) ∧¬Q ⇔¬P ∧¬Q P →⊥⇔¬P P →⊤⇔⊤ ⊤→P ⇔P ⊥→P ⇔⊤ Normal Forms Negation Normal Form • Literals: Atomic Sentences or negations thereof. • Negation Normal Form: An expression built up with ‘∧’, ‘∨’, and literals. • Using repeated DeMorgan and Double Negation, we can transform any truth-functional expression built up with ‘∧’, ‘∨’, and ‘¬’ into an expression that is in Negation Normal Form. • Example: ¬((A ∨B) ∧¬C) ⇔ (DeMorgan) ¬(A ∨B) ∨¬¬C ⇔ (Double Neg, DeM) (¬A ∧¬B) ∨C Disjunctive Normal Form • Disjunctive Normal Form: A generalized disjunction of generalized conjunctions of literals. • Using repeated distribution of ∧over ∨, any s