Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    ACTIVITY 2 Logic and Proofs

    Uploaded by

    maricar vinoya
    The document defines six logical concepts: negation, conjunction, disjunction, exclusive or, conditional statements, and biconditional statements. It also provides truth tables for each concept and examples of compound propositions using multiple concepts.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    ACTIVITY 2 Logic and Proofs

    Uploaded by

    maricar vinoya
    9 views4 pages
    The document defines six logical concepts: negation, conjunction, disjunction, exclusive or, conditional statements, and biconditional statements. It also provides truth tables for each concept and examples of compound propositions using multiple concepts.

    Original Title

    ACTIVITY 2 Logic and Proofs (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?

    The document defines six logical concepts: negation, conjunction, disjunction, exclusive or, conditional statements, and biconditional statements. It also provides truth tables for each concept and examples of compound propositions using multiple concepts.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    9 views4 pages

    ACTIVITY 2 Logic and Proofs

    Uploaded by

    maricar vinoya
    The document defines six logical concepts: negation, conjunction, disjunction, exclusive or, conditional statements, and biconditional statements. It also provides truth tables for each concept and examples of compound propositions using multiple concepts.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    ACTIVITY 2

    Task: 1. Copy on a clean sheet of papers or bond papers.


    2. Make sure to understand all the Six Definitions of Logic and Proofs.
    3. Compound proposition is the application of the Six Definitions of Logic and Proofs.

     Definition 1:
    Let p be a proposition. The negation of p, denoted by ￢p (also denoted by ̅p), is the statement “It
    is not the case that p.”
    The proposition ￢p is read “NOT ̅p”. The truth value of the negation of p, ￢p, is the opposite of the truth value
    of p.

    TABLE 1:

    The Truth Table for the Negation


    of a Proposition.

    𝒑 ̅𝒑

    T F

    F T

     Definition 2:
    Let p and q be propositions. The conjunction of p and q, denoted by p ∧ q, is the proposition “p AND q”. The
    conjunction p ∧ q is true when both p and q are true and is false otherwise.

    TABLE 2:

    The Truth Table for the Conjunction of Two Propositions.

    𝒑 q 𝒑∧𝒒
    T T T

    T F F
    F T F

    F F F

     Definition 3:

    Page 1 of 4
    Let p and q be propositions. The disjunction of p and q, denoted by p ∨ q, is the proposition “p OR q”.
    The disjunction p ∨ q is false when both p and q are false and is true otherwise.

    TABLE 3:

    The Truth Table for the Disjunction of Two


    Propositions.

    𝒑 q 𝒑∨𝒒
    T T T

    T F T

    F T T

    F F F

     Definition 4:
    Let p and q be propositions. The exclusive or of p and q, denoted by p ⨁ q, is the proposition that is true when
    exactly one of p and q is true and is false otherwise.

    TABLE 4:

    The Truth Table for the Exclusive OR of Two


    Propositions.

    𝒑 q 𝒑⊕𝒒
    T T F
    T F T
    F T T
    F F F

     Definition 5:
    Let p and q be propositions. The conditional statement p → q is the proposition “if p, then q.” The conditional
    statement p → q is false when p is true and q is false, and true otherwise. In the conditional statement p → q, p
    is called the hypothesis (or antecedent or premise) and q is called the conclusion (or consequence).

    TABLE 5:
    The Truth Table for the Conditional Statement p
    → q.
    𝒑 q 𝒑→𝒒
    T T T

    T F F

    F T T
    F F T
     Definition 6:
    Let p and q be propositions. The biconditional statement p ↔ q is the proposition “p if and only if q”. The
    biconditional statement p ↔ q is true when p and q have the same truth values, and is false otherwise.
    Biconditional statements are also called bi-implications.

    TABLE 6:

    Page 2 of 4
    The Truth Table for the Biconditional p ↔ q.

    𝒑 q 𝒑↔𝒒
    T T T
    T F F
    F T F
    F F T

    Compound Proposition
    A compound proposition is a proposition that involves the assembly of multiple statements.
    Familiarization of the functions or the truth table of every propositions is very important because this will allow
    to use it effectively.

    Ex:
    Construct the Truth Table of the following compound proposition:
    1) → 𝑞̅

    𝒑 𝒒 𝒒 𝒑→𝒒
    T T F F
    T F T T
    F T F T
    F F T T

    2) ↔ 𝑞̅

    𝒑 𝒒 𝒑 𝒑 ↔𝒒
    T T F F
    T F F T
    F T T T
    F F T F

    3) (𝑝 → 𝑞̅ 𝑝 → 𝑞̅)

    𝒑 𝒒 𝒑 (𝒑 → 𝒒) (𝒑 → 𝒒)
    T T F T T T
    T F F F T T
    F T T T T T
    F F T T F T

    Page 3 of 4
    4) (𝑝 → 𝑞̅ 𝑝 → 𝑞̅)

    𝒑 𝒒 𝒑 (𝒑 → 𝒒) (𝒑 → 𝒒)
    T T F T T T
    T F F F T F
    F T T T T T
    F F T T F F

    5) (𝑝 ↔ 𝑞̅ 𝑝 ↔ 𝑞̅)

    𝒑 𝒒 𝒑 (𝒑 ↔ 𝒒) (𝒑 ↔ 𝒒) (𝒑 ↔ 𝒒 𝒑 ↔ 𝒒)
    T T F F T T

    T F F T F T

    F T T T F T

    F F T F T T

    Page 4 of 4

    You might also like