Scribd Logo
Upload

Welcome to Scribd!

  • 53 views

    Math 104 Module 1 Beamer (Rules of Inference)

    Uploaded by

    Jonwille Mark Castro
    This document provides 3 examples of proofs in logic and set theory. Example 1 proves S ∧ T from premises P ∨ Q ⇒ S ∧ T and P using modus ponens. Example 2 proves P ⇒ S from premises P ⇒ ¬Q and S ∨ Q using modus ponens, adjunction, and principle II. Example 3 proves R ⇒ ¬S from premises P ⇒ N, ¬P ⇒ ¬S, and R ⇒ ¬N using modus ponens, substitution, and principle I. Detailed step-by-step proofs are provided for each example.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Math 104 Module 1 Beamer (Rules of Inference)

    Uploaded by

    Jonwille Mark Castro
    53 views76 pages
    This document provides 3 examples of proofs in logic and set theory. Example 1 proves S ∧ T from premises P ∨ Q ⇒ S ∧ T and P using modus ponens. Example 2 proves P ⇒ S from premises P ⇒ ¬Q and S ∨ Q using modus ponens, adjunction, and principle II. Example 3 proves R ⇒ ¬S from premises P ⇒ N, ¬P ⇒ ¬S, and R ⇒ ¬N using modus ponens, substitution, and principle I. Detailed step-by-step proofs are provided for each example.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides 3 examples of proofs in logic and set theory. Example 1 proves S ∧ T from premises P ∨ Q ⇒ S ∧ T and P using modus ponens. Example 2 proves P ⇒ S from premises P ⇒ ¬Q and S ∨ Q using modus ponens, adjunction, and principle II. Example 3 proves R ⇒ ¬S from premises P ⇒ N, ¬P ⇒ ¬S, and R ⇒ ¬N using modus ponens, substitution, and principle I. Detailed step-by-step proofs are provided for each example.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    53 views76 pages

    Math 104 Module 1 Beamer (Rules of Inference)

    Uploaded by

    Jonwille Mark Castro
    This document provides 3 examples of proofs in logic and set theory. Example 1 proves S ∧ T from premises P ∨ Q ⇒ S ∧ T and P using modus ponens. Example 2 proves P ⇒ S from premises P ⇒ ¬Q and S ∨ Q using modus ponens, adjunction, and principle II. Example 3 proves R ⇒ ¬S from premises P ⇒ N, ¬P ⇒ ¬S, and R ⇒ ¬N using modus ponens, substitution, and principle I. Detailed step-by-step proofs are provided for each example.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 76

    Math 104 (Logic and Set Theory)

    More Examples on Rules of Inference

    Jonwille Mark Castro

    The Adelphi College, Inc.

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Recall

    Rules of Inference:
    Modus Ponens (MP): P ∧ (P ⇒ Q) ⇒ Q
    Adjoining Premises (AP)
    Direct Proof of an Implication (DPI)
    Adjunction (Adj): (R ⇒ P) ∧ (R ⇒ Q) ⇔ (R ⇒ P ∧ Q)
    Substitution (Sub)
    Contradiction (Contra)
    Additional Premises:
    Pr I: (P ⇒ S) ⇔ (¬S ⇒ ¬P)
    Pr II: ¬Q ∧ (S ∨ Q) ⇒ S
    Pr III: ¬¬R ⇔ R
    Pr IV: P ⇒ P ∨ R

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:
    1.P (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:
    1.P (Pr)
    2.P ⇒ P ∨ Q (Pr IV)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:
    1.P (Pr)
    2.P ⇒ P ∨ Q (Pr IV)
    3.P ∨ Q (1, 2, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:
    1.P (Pr)
    2.P ⇒ P ∨ Q (Pr IV)
    3.P ∨ Q (1, 2, MP)
    4.P ∨ Q ⇒ S ∧ T (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 1

    Premises: P ∨ Q ⇒ S ∧ T , P
    Prove: S ∧ T
    Proof:
    1.P (Pr)
    2.P ⇒ P ∨ Q (Pr IV)
    3.P ∨ Q (1, 2, MP)
    4.P ∨ Q ⇒ S ∧ T (Pr)
    5.S ∧ T (3, 4, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)
    4.S ∨ Q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)
    4.S ∨ Q (Pr)
    5.¬Q ∧ (S ∨ Q) (3, 4, Adj)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)
    4.S ∨ Q (Pr)
    5.¬Q ∧ (S ∨ Q) (3, 4, Adj)
    6.¬Q ∧ (S ∨ Q) ⇒ S (Pr II)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)
    4.S ∨ Q (Pr)
    5.¬Q ∧ (S ∨ Q) (3, 4, Adj)
    6.¬Q ∧ (S ∨ Q) ⇒ S (Pr II)
    7.S (5, 6, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 2

    Premises: P ⇒ ¬Q, S ∨ Q
    Prove: P ⇒ S
    Proof:
    1.P (Hyp)
    2.P ⇒ ¬Q (Pr)
    3.¬Q (1, 2, MP)
    4.S ∨ Q (Pr)
    5.¬Q ∧ (S ∨ Q) (3, 4, Adj)
    6.¬Q ∧ (S ∨ Q) ⇒ S (Pr II)
    7.S (5, 6, MP)
    8.P ⇒ S (1, 7, DPI)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)
    6.¬N ⇒ ¬P (4, 5, Sub)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)
    6.¬N ⇒ ¬P (4, 5, Sub)
    7.¬P (3, 6, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)
    6.¬N ⇒ ¬P (4, 5, Sub)
    7.¬P (3, 6, MP)
    8.¬P ⇒ ¬S (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)
    6.¬N ⇒ ¬P (4, 5, Sub)
    7.¬P (3, 6, MP)
    8.¬P ⇒ ¬S (Pr)
    9.¬S (7, 8, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 3

    Premises: P ⇒ N, ¬P ⇒ ¬S, R ⇒ ¬N
    Prove: R ⇒ ¬S
    Proof:
    1.R (Hyp)
    2.R ⇒ ¬N (Pr)
    3.¬N (1, 2, MP)
    4.P ⇒ N (Pr)
    5.(P ⇒ N) ⇔ (¬N ⇒ ¬P) (Pr I)
    6.¬N ⇒ ¬P (4, 5, Sub)
    7.¬P (3, 6, MP)
    8.¬P ⇒ ¬S (Pr)
    9.¬S (7, 8, MP)
    10.R ⇒ ¬S (1, 9, DPI)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)
    6.¬P (4, 5, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)
    6.¬P (4, 5, MP)
    7.¬P ∧ R (6, 1, Adj)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)
    6.¬P (4, 5, MP)
    7.¬P ∧ R (6, 1, Adj)
    8.¬P ∧ R ⇒ S (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)
    6.¬P (4, 5, MP)
    7.¬P ∧ R (6, 1, Adj)
    8.¬P ∧ R ⇒ S (Pr)
    9.S (7, 8, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 4

    Premises: P ⇒ Q, ¬P ∧ R ⇒ S, ¬Q
    Prove: R ⇒ S
    Proof:
    1.R (Hyp)
    2.P ⇒ Q (Pr)
    3.(P ⇒ Q) ⇔ (¬Q ⇒ ¬P) (Pr I)
    4.¬Q ⇒ ¬P (2, 3, Sub)
    5.¬Q (Pr)
    6.¬P (4, 5, MP)
    7.¬P ∧ R (6, 1, Adj)
    8.¬P ∧ R ⇒ S (Pr)
    9.S (7, 8, MP)
    10.R ⇒ S (1, 9, DPI)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)
    9.P (7, 8, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)
    9.P (7, 8, MP)
    10.P ⇒ S (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)
    9.P (7, 8, MP)
    10.P ⇒ S (Pr)
    11.S (9, 10, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)
    9.P (7, 8, MP)
    10.P ⇒ S (Pr)
    11.S (9, 10, MP)
    12.¬S ∧ S (1, 11, Adj)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 5
    Premises: P ∨ R, P ⇒ S, R ⇒ S
    Prove: S
    Proof:
    1.¬S (Neg of concl)
    2.R ⇒ S (Pr)
    3.(R ⇒ S) ⇔ (¬S ⇒ ¬R) (Pr I)
    4.¬S ⇒ ¬R (2, 3, Sub)
    5.¬R (1, 4, MP)
    6.P ∨ R (Pr)
    7.¬R ∧ (P ∨ R) (5, 6, Adj)
    8.¬R ∧ (P ∨ R) ⇒ P (Pr II)
    9.P (7, 8, MP)
    10.P ⇒ S (Pr)
    11.S (9, 10, MP)
    12.¬S ∧ S (1, 11, Adj)
    13.S (1, 12, Contra)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)
    6.¬p (4, 5, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)
    6.¬p (4, 5, MP)
    7.¬p ∧ r (1, 6, Adj)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)
    6.¬p (4, 5, MP)
    7.¬p ∧ r (1, 6, Adj)
    8.¬p ∧ r ⇒ s (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)
    6.¬p (4, 5, MP)
    7.¬p ∧ r (1, 6, Adj)
    8.¬p ∧ r ⇒ s (Pr)
    9.s (7, 8, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 6

    Premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, (p ⇒ q) ⇔ (¬q ⇒ ¬p)


    Prove: r ⇒ s
    Proof:
    1.r (Hyp)
    2.(p ⇒ q) ⇔ (¬q ⇒ ¬p) (Pr)
    3.p ⇒ q (Pr)
    4.¬q ⇒ ¬p (2, 3, Sub)
    5.¬q (Pr)
    6.¬p (4, 5, MP)
    7.¬p ∧ r (1, 6, Adj)
    8.¬p ∧ r ⇒ s (Pr)
    9.s (7, 8, MP)
    10.r ⇒ s (1, 9, DPI)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)
    4.¬j ⇒ ¬d (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)
    4.¬j ⇒ ¬d (Pr)
    5.¬d (3, 4, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)
    4.¬j ⇒ ¬d (Pr)
    5.¬d (3, 4, MP)
    6.¬d ⇒ p (Pr)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)
    4.¬j ⇒ ¬d (Pr)
    5.¬d (3, 4, MP)
    6.¬d ⇒ p (Pr)
    7.p (5, 6, MP)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Example 7

    Premises: n ⇒ ¬j, ¬j ⇒ ¬d, ¬d ⇒ p


    Prove: n ⇒ p
    Proof:
    1.n (Hyp)
    2.n ⇒ ¬j (Pr)
    3.¬j (1, 2, MP)
    4.¬j ⇒ ¬d (Pr)
    5.¬d (3, 4, MP)
    6.¬d ⇒ p (Pr)
    7.p (5, 6, MP)
    8.n ⇒ p (1, 7, DPI)

    Jonwille Mark Castro Math 104 (Logic and Set Theory)


    Math 104 (Logic and Set Theory)
    More Examples on Rules of Inference

    Jonwille Mark Castro

    The Adelphi College, Inc.

    Jonwille Mark Castro Math 104 (Logic and Set Theory)

    You might also like