Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Lecture 2

    Uploaded by

    b22ee084
    This document provides an overview of compound propositions and truth tables. It defines compound propositions as those formed using logical operators such as negation, conjunction, disjunction, conditional, biconditional on existing propositions. Truth tables are presented as a way to systematically represent all possible combinations of truth values of the component propositions and the truth value of the compound proposition. Specific truth tables are given for negation, conjunction, disjunction, and conditional. Conditional statements are also discussed, defining terms like converse, contrapositive, and inverse.

    Copyright:

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

    Lecture 2

    Uploaded by

    b22ee084
    18 views11 pages
    This document provides an overview of compound propositions and truth tables. It defines compound propositions as those formed using logical operators such as negation, conjunction, disjunction, conditional, biconditional on existing propositions. Truth tables are presented as a way to systematically represent all possible combinations of truth values of the component propositions and the truth value of the compound proposition. Specific truth tables are given for negation, conjunction, disjunction, and conditional. Conditional statements are also discussed, defining terms like converse, contrapositive, and inverse.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of compound propositions and truth tables. It defines compound propositions as those formed using logical operators such as negation, conjunction, disjunction, conditional, biconditional on existing propositions. Truth tables are presented as a way to systematically represent all possible combinations of truth values of the component propositions and the truth value of the compound proposition. Specific truth tables are given for negation, conjunction, disjunction, and conditional. Conditional statements are also discussed, defining terms like converse, contrapositive, and inverse.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    18 views11 pages

    Lecture 2

    Uploaded by

    b22ee084
    This document provides an overview of compound propositions and truth tables. It defines compound propositions as those formed using logical operators such as negation, conjunction, disjunction, conditional, biconditional on existing propositions. Truth tables are presented as a way to systematically represent all possible combinations of truth values of the component propositions and the truth value of the compound proposition. Specific truth tables are given for negation, conjunction, disjunction, and conditional. Conditional statements are also discussed, defining terms like converse, contrapositive, and inverse.

    Copyright:

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

    Lecture 2

    Compound Propositions, Truth Table


    Compound Propositions
    Propositions can be denoted by propositional variables such as p, q, r, s, etc.

    Examples:

    p = New Delhi is the capital of India.


    q = 45 is a prime number.

    We will now focus on producing new propositions from existing propositions.

    De nition: A compound proposition is formed from existing propositions using logical


    operators such as ¬, ∨ , ∧ , → , and ↔.
    fi
    Negation
    De nition: Let p be a proposition. The negation of p, denoted by ¬p, is the statement
    “It is not the case that p”.
    ¬p is read as “not p.” The truth value of ¬p is the opposite of the truth value of p.

    Examples:
    p = Sam uses an Android phone.
    ¬p = It is not the case that Sam uses an Android phone.
    ¬p = Sam does not use an Android phone. (more simply expressed negation.)

    q = Emma’s PC has at least 256 GB of memory.


    ¬q = It is not the case that Emma’s PC has at least 256 GB of memory.
    ¬q = Emma’s PC has less than 256 GB of memory. (more simply expressed negation.)
    fi
    Truth Table

    De nition: A truth table of a compound proposition is a structured representation that


    presents all possible combinations of truth values of propositions used in that compound
    proposition and the corresponding truth value of it.

    Truth Table of negation (¬):

    p ¬p
    T F
    F T
    fi
    Conjunction

    De nition: Let p and q be propositions. The conjunction of p and q, denoted by p ∧ q, is the


    statement “p and q”.

    The conjunction “p and q” is true when both p and q are true and is false otherwise.

    Example:

    p = Sam uses an Android phone.


    q = Sam uses a Macbook.
    p ∧ q = Sam uses an Android phone and Sam uses a Macbook.
    fi
    Disjunction
    De nition: Let p and q be propositions. The disjunction of p and q, denoted by p ∨ q, is the
    statement “p or q”.
    The disjunction “p or q” is false when both p and q are false and is true otherwise.
    Example:
    p = Sam uses an Android phone.
    q = Sam uses a Macbook.
    p ∨ q = Sam uses an Android phone or Sam uses a Macbook.
    Note: Disjunction corresponds to “inclusive or” of English, not “exclusive or”.

    Students who have taken calculus or analysis can take this class.

    Soup or salad comes with the main course.


    fi
    Truth Tables of Conjunction and Disjunction

    Truth Table of conjunction (∧) Truth Table of disjunction (∨)

    p q p∧q p q p∨q
    F F F F F F
    F T F F T T
    T F F T F T
    T T T T T T
    Conditional Statements
    De nition: Let p and q be propositions. The conditional statement, denoted by p → q,
    is the statement “if p, then q”.
    p is called the hypothesis and q is called the conclusion.

    Truth Table of conditional statement (→)

    p q p→q
    F F T
    F T T
    T F F
    T T T
    fi
    Conditional Statements
    Example 1:

    p = Alice scores 100% in Major.


    q = Alice gets an A.
    p → q = If Alice scores 100% in Major, then Alice gets an A.

    Example 2:

    p = Jack inserts a coin of 5 in vending machine.


    q = Vending machine gives a chocolate.
    p → q = If Jack inserts a coin of 5 in vending machine, then vending machine gives a
    chocolate.
    Conditional Statements
    Some more ways to express p → q.
    ‣ If p, then q.
    ‣ q if p.
    ‣ p is su cient for q.
    ‣ p implies q.
    ‣ q is necessary for p.
    ‣ Etc.

    Is the below proposition true? Yes.

    If 5 is a prime number, then 2 + 2 = 4.

    Note: Conditional statements in logic do not have a cause-and-e ect relationship.


    ffi
    ff
    Conditional Statements
    De nition: For a proposition p → q:
    ‣ q → p is called the converse of p → q.
    ‣ ¬q → ¬p is called the contrapositive of p → q.
    ‣ ¬p → ¬q is called the inverse of p → q.
    p q p→q q→p ¬p ¬q ¬p → ¬q ¬q → ¬p
    F F T T T T T T
    F T T F T F F T
    T F F T F T T F
    T T T T F F T T
    Same truth values.

    Same truth values.


    fi

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy