Scribd Logo
Upload

Welcome to Scribd!

  • Inference Task

    Uploaded by

    Mahe Lee
    5 views1 page
    1. Prove that the statement [(p ∨ q) ∧ p̅] → q is logically equivalent to the tautology T using substitution. 2. Use formal proof rules and replacement laws to prove the validity of an argument with premises [(a ∨ c) ∧ b̅] → [(d → c) → f], a̅ → b, and b̅, concluding (d → c) → f. 3. Provide a formal proof in symbols of an argument's validity where the premises are e → (f ∧ g̅), (f ∨ g) → h, and e, concluding h, using propositional variables b, n, and

    Original Description:

    Original Title

    Inference Task (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. Prove that the statement [(p ∨ q) ∧ p̅] → q is logically equivalent to the tautology T using substitution. 2. Use formal proof rules and replacement laws to prove the validity of an argument with premises [(a ∨ c) ∧ b̅] → [(d → c) → f], a̅ → b, and b̅, concluding (d → c) → f. 3. Provide a formal proof in symbols of an argument's validity where the premises are e → (f ∧ g̅), (f ∨ g) → h, and e, concluding h, using propositional variables b, n, and

    Copyright:

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

    Inference Task

    Uploaded by

    Mahe Lee
    1. Prove that the statement [(p ∨ q) ∧ p̅] → q is logically equivalent to the tautology T using substitution. 2. Use formal proof rules and replacement laws to prove the validity of an argument with premises [(a ∨ c) ∧ b̅] → [(d → c) → f], a̅ → b, and b̅, concluding (d → c) → f. 3. Provide a formal proof in symbols of an argument's validity where the premises are e → (f ∧ g̅), (f ∨ g) → h, and e, concluding h, using propositional variables b, n, and

    Copyright:

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

    1.

    Prove with the substitution rule: [( p ∨q)∧ p̅ ]→q is equivalent to T (true)


    2. Prove with formal proof the validity of the following argument (use the rules of inference and
    replacement law).

    Premis 1: [(a ∨ c)∧b̅ ]→[(d →c )→ f ]


    Premis 2: a̅ → b
    Premis 3: b̅
    ¿ ∴(d → c)→ f
    Premis 1: e →(f ∧ g̅ )
    Premis 2: ( f ∨ g) → h
    Premis 3: e
    ¿∴h
    3. Write a formal proof of the validity of the argument below using symbols proposition as
    provided. If I study then I get good grades, if I don't study then I get having fun. Therefore I will
    get good or I will have fun (b,n,s).

    You might also like