# Propositional Proofs 2.

## Presentation on theme: "Propositional Proofs 2."— Presentation transcript:

Propositional Proofs 2

Rules of Inference and Formal Proofs
Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument is sequence of propositions. All but the final proposition are called premises and the final proposition is called the conclusion. The argument is valid if the conclusion (final statement) follows from the truth of the preceding statements (premises). In other words, an argument form with premises p1; p2; : : ; pn and conclusion q is valid if and only if (p1 ^ p2 ^ ^ pn) → q Rules of inference are templates for building valid arguments. We will study rules of inferences for compound propositions, for quantified statements, and then see how to combine them. These will be the main ingredients needed in formal proofs.

Nine Basic Inference Rules
Modus Ponens (MP) p  q P q Modus Tollens (MT) ~q  ~p Disjunctive Syllogism (DS) p ∨ q ~ P Hypothetical Syllogism (HS) q  r  p r Simplification p ∧ q  p Conjunction p q  p ∧ q Addition  p ∨ q Constructive Dilemma p  r q  s r ∨ s Absorption p  q : : p  (p ∧ q)

Rules of Equivalence Double Negation (DN) p :: ~ ~ p ~ ~ p :: p
DeMorgan (DM) ~(p ∨ q) :: (~p ∧ ~q) ~(p ∧ q) :: (~p ∨ ~q) Association (Asso) (p ∨ q) ∨ r :: p ∨ (q ∨ r) (p ∧ q) ∧ r :: p ∧ (q ∧ r) Distribution (Dist) [p ∧ (q ∨ r)] :: [(p ∧ q) ∨ (p ∧ r)] [p ∨ (q ∧ r)] :: [(p ∨ q) ∧ (p ∨ r)] Material Implication (MI) (p  q) :: (~p ∨ q) Exportation (Exp) ((p ∧ q)  r) :: (p  (q  r)) Material Equivalence (ME) (p  q) :: [(p ∧ q) ∨ (~p ∧ ~q)] (p  q) :: [(p  q) ∧ (q  p)] Redundancy (Re) p :: (p ∧ p) p :: (p ∨ p) Contraposition (Cont) (p  q) :: (~q  ~p) Commutation (Comm) p ∨ q :: q ∨ p p ∧ q :: q ∧ p

Examples Ex.1: State which rule of inference is the basis of the following argument: “It is below freezing now. Therefore, it is either below freezing or raining now.” Sol: Let p be “It is below freezing now” and q be “It is raining now.” Then the argument is of the form p ∴ p∨q Thus it is addition

Examples Ex.2: State which rule of inference is used in the argument:
If it rains today, then we will not have a barbecue today. If we do not have a barbecue today, then we will not have a barbecue tomorrow. Therefore, if it rains today, then we will not have a barbecue tomorrow. Sol: : Let p be “It is raining today”, q be “We will not have a barbecue today” and r be “We will not have a barbecue tomorrow.” Then the argument is of the form p→q q→r ∴ p→r So this argument is a hypothetical syllogism

Ex. 1 Show that the hypotheses:
It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny. If we do not go swimming, then we will take a field trip. If we take a field trip, then we will be home by sunset. lead to the conclusion: We will be home by the sunset. Main Steps Translate the statements into proposional logic. Write a formal proof, a sequence of steps that state hypotheses or apply inference rules to previous steps.

Ex. 1 Proof Show that the hypotheses:
It is not sunny this afternoon and it is colder than yesterday. ¬𝑠∧𝐶 We will go swimming only if it is sunny. 𝑤→𝑠 If we do not go swimming, then we will take a field trip. ¬𝑤→𝑡 If we take a field trip, then we will be home by sunset. 𝑡→ℎ lead to the conclusion: We will be home by the sunset. ℎ Where: s: \it is sunny this afternoon“ c: \it is colder than yesterday“ w: \we will go swimming“ t: \we will take a field trip. h: \we will be home by the sunset." Step Reason 1. ¬𝑠 ∧ 𝑐 premise 2. ¬𝑠 simplification 3. 𝑤→𝑠 4. ¬𝑤 2, 3 modus tollens 5. ¬𝑤→𝑡 6. t 4, 5 modus ponens 7. 𝑡→ℎ 8. h 6, 7 modus ponens

Ex. 2 Show that the hypotheses:
The space shuttle landed in Florida (f ) or it landed in California (c) If the space shuttle landed in California then the alternate landing shuttle was used (a) But the alternate landing shuttle was not used. Therefore, the space shuttle was landed in Florida Step Reason 1. 𝒇∨𝒄 P1 2. 𝒄→𝒂 P2 3. ¬𝒂 P3 4. ¬𝒄 2, 3 modus tollens 5. ¬𝒇→𝒄 1 MI 6. 𝒇 4, 5 modus tollens 1. 𝒇∨𝒄 P1 2. 𝒄→𝒂 P2 3. ¬𝒂 P3 C: 𝒇

Ex. 3 Show that the hypotheses:
If the February has 29 days (d ), then it is leap year (l ) If it is a leap year, then there will be a presidential election (e) But there is not a presidential election. Therefore, February does not have 29 days Step Reason 1. 𝒅→𝒍 P1 2. 𝒍→𝒆 P2 3. ¬𝒆 P3 4. 𝒅→𝒆 1, 2 H.S 5. ¬𝒅 3, 4 MT 1. 𝒅→𝒍 P1 2. 𝒍→𝒆 P2 3. ¬𝒆 P3 C:¬𝒅

Ex. 4 Using line numbers and the abbreviations for the rules to inference the following 1. 𝑪∨𝑫 𝟐. 𝑪⟶𝑶 3. 𝑫⟶𝑴 4. ¬ 𝑶 𝑴 1. 𝑪∨𝑫 Premise 2. 𝑪⟶𝑶 3. 𝑫⟶𝑴 4. ¬ 𝑶 5. ¬ 𝑪 2, 4 MT 6. 𝑫 1, 5 DS 7. 𝑴 3, 6 MP 1. 𝑪∨𝑫 Premise 2. 𝑪⟶𝑶 3. 𝑫⟶𝑴 4. ¬ 𝑶 5. 𝑶∨𝑴 1,2, 3 CD 6. 𝑴 4, 5 DS Another Solution

using only the axioms and inference rules
Example Prove the theorem (p ⟶ q) ⟶ (¬q ⟶ ¬p) using only the axioms and inference rules

Resolution Theorem Intro.
Propositional resolution: is an extremely powerful rule of inference for Propositional Logic. What's more, the search space using propositional resolution is much smaller than for standard propositional logic. Before we talk about proof, with the idea that you write down some promises, statements that you’re given, and then you try to derive something from them. Resolution: is the way that pretty much every modern automated theorem-prover is implemented. It's apparently the best way for computers to think about proving things.

Clausal Form Propositional resolution works only on expressions in clausal form. Before the rule can be applied, the premises and conclusions must be converted to this form. A literal is either an atomic sentence or a negation of an atomic sentence. For example, if p is a logical constant, the following sentences are both literals: p , ¬ p A clause expression is either a literal or a disjunction of literals. If p and q are logical constants, then the following are clause expressions p, ¬ p, p ∨q A clause is the set of literals in a clause expression. For example, the following sets are the corresponding clauses: {p}, {¬p}, {p , q} Note that the empty set {} is also a clause. It is equivalent to an empty disjunction.

Converting to clausal form
1. Implications (I): j j2 ® ¬ j1 ∨ j2 j j2 ® j1 ∨ ¬ j2 j j2 ® (¬ j1 ∨ j2 ) ∧ (j1 ∨ ¬ j2 ) 2. Negations (N): ¬ ¬ j ® j ¬ (j1 ∧ j2 ) ® ¬ j1 ∨ ¬ j2 ¬ (j1 ∨ j2 ) ® ¬ j1 ∧ ¬ j2 3. Distribution (D): j1∨ (j2 ∧ j3 ) ® (j1 ∨ j2) ∧ (j1 ∨ j3 ) (j1 ∧ j2 ) ∨ j3 ® (j1 ∨ j3) ∧ (j2 ∨ j3) (j1 ∨ j2 ) ∨ j3 ® j1 ∨ (j2 ∨ j3 ) (j1 ∧ j2 ) ∧ j3 ® j1 ∧ (j2 ∧ j3) 4. Operators (O): j1 ∨ ... ∨ jn ® {j1,...,jn} j1 ∧ ... ∧ jn ® {j1}...{jn}

Examples Ex.1 Ex. 2 g ∧ (r f ) I g ∧ (¬ r ∨ f ) I ¬ ( g ∧ (¬ r ∨ f ))
O { g } {¬ r, f } ¬ ( g ∧ (r f )) I ¬ ( g ∧ (¬ r ∨ f )) N ¬ g ∨ ¬ (¬ r ∨ f ) ¬ g ∨ (¬ ¬ r ∧ ¬ f ) ¬ g ∨ (r ∧ ¬ f ) D (¬ g ∨ r ) ∧ (¬ g ∨ ¬ f ) O {¬ g , r } {¬ g , ¬ f }

Propositional Resolution
The idea of resolution is simple. Suppose we know that p is true or q is true, and suppose we also know that p is false or r is true. One clause contains p, and the other contains ¬ p. If p is false, then by the first clause q must be true. If p is true, then, by the second clause, r must be true. Since p must be either true or false, then it must be the case that q is true or r is true. In other words, we can cancel the p literals. p v q ¬ p v r q v r {p , q} { p , r } {q , r }

Resolution in propositional Logic
More generally, given a clause containing a literal c and another clause containing the literal c , we can infer the clause consisting of all the literals of both clauses without the complementary pair. This rule of inference is called propositional resolution {j1,..., c,..., jm} {y1,..., c,..., yn} {j1,...,jm,y1,...,yn}

Example Ex.: Use resolution to show that the hypotheses “Jasmine is skiing or it is not snowing” and “It is snowing or Bart playing hockey” imply “Jasmine is skiing or Bart is playing hockey.” Sol.: Let p: “Jasmine is skiing,” q: “It is snowing,” r: “Bart playing hockey.” So we have the hypotheses: p∨¬q and q∨r. Applying resolution p∨r follows. The other way: (p∨¬q) ∧ (q∨r) = (q∨r) ∧ (p∨¬q) =(¬r→q) ∧(q→p). Applying Hypotheses syllogism, from (¬r→q) ∧(q→p) follows (¬r →p). Evidently (¬r →p) = (r∨p).

Example 1. {p , q} Premise 2. {Ø p , q } 3. {p , Ø q } 4. {Ø p , Ø q }
1,2 6. {Ø q } 3,4 7. {} 5,6

Example {p , q} Premise {¬ p ,r } Premise {¬ q , r } Premise
{} 4,9

Example 1. P v Q {P , Q} Primes 2. ¬ P v R {¬ P , R} 3. ¬ Q v R
{¬ Q , R} 4. ¬ R {¬ R} Negated conclusion 5. Q v R {Q , R} 1, 2 6. ¬ P {¬ P} 2, 4 7. ¬ Q {¬ Q} 3, 4 8. R {R} 5, 6 9. {} {} 4, 8 Prove R 1. P v Q 2. P R 3. Q R

Homework Show that the hypotheses “If you send me an message, then I will finish writing the program,” “If you do not send me an message, then I will go to sleep early,” and “If I go to sleep early, then I will wake up feeling refreshed” lead to the conclusion “If I do not finish writing the program, then I will wake up feeling refreshed.” Show that the hypotheses (p∧q)∨r and r→s imply the conclusion p∨s.

Thank You!