Scribd Logo
Upload

Welcome to Scribd!

  • 192 views

    Simple and Compound Statements

    Uploaded by

    Sarah S Figueroa
    The document defines simple and compound statements in logic. Simple statements are declarative sentences without connectives, while compound statements combine two or more simple statements using conjunction, conditional, negation, disjunction, or biconditional connectives. Examples are provided of translating English language statements to their symbolic logical forms using these connectives.

    Copyright:

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

    Simple and Compound Statements

    Uploaded by

    Sarah S Figueroa
    192 views28 pages
    The document defines simple and compound statements in logic. Simple statements are declarative sentences without connectives, while compound statements combine two or more simple statements using conjunction, conditional, negation, disjunction, or biconditional connectives. Examples are provided of translating English language statements to their symbolic logical forms using these connectives.

    Original Title

    8. Simple and Compound Statements

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines simple and compound statements in logic. Simple statements are declarative sentences without connectives, while compound statements combine two or more simple statements using conjunction, conditional, negation, disjunction, or biconditional connectives. Examples are provided of translating English language statements to their symbolic logical forms using these connectives.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    192 views28 pages

    Simple and Compound Statements

    Uploaded by

    Sarah S Figueroa
    The document defines simple and compound statements in logic. Simple statements are declarative sentences without connectives, while compound statements combine two or more simple statements using conjunction, conditional, negation, disjunction, or biconditional connectives. Examples are provided of translating English language statements to their symbolic logical forms using these connectives.

    Copyright:

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

    Simple and

    Compound
    Statements

    LOGIC 213
    Definition
    – A statement (or proposition) is a
    sentence (or assertion) that is true
    or false but not both. We typically
    use letters like p, q to denote
    propositions.
    Simple Statements

    * declarative sentences which do not contain


    a connective
    * The restriction to declarative sentences is
    important.
    *S – C – P
    EXAMPLE:

    – Grass is green.
    –  Ignacio is hungry.
    – It is snowing.
    – Annapolis is the capital of United States.
    – All is fair in love.
    Compound Statements

    * A combination of two or more simple


    statements.
    * Conjunction
    * Conditional
    * Negation
    CONJUNCTION

    – compound statement formed by connecting


    statements with the word “for, and, nor,
    but, or, yet, so, etc.”
    – The symbol is (∧ )
    EXAMPLE:

    – Let p and q represent the following simple statements:


    p: It is after 5 P.M.
    q: They are working.
    – Write each compound statement below in symbolic
    form:
    It is after 5 P.M. and they are working.
    p∧q
    DISJUNCTION

    – compound statement formed using the


    inclusive “or”
    – represented by the symbol ∨
    EXAMPLE:

    – Let p and q represent the following simple statements:


    p: The bill receives majority approval.
    q: The bill becomes a law.
    – Write each compound statement below in symbolic form:
    The bill receives majority approval or the bill becomes
    a law.
    p∨q
    CONDITIONAL

    – If-Then Statements
    – “If p, then q is symbolized by p → q
    – The statement before the → is called the
    antecedent.
    – The statement after the → is called the
    consequent.
    EXAMPLE:

    – Let p and q represent the following simple statements:


    p: A person is a father.
    q: A person is a male.
    – Write each compound statement below in symbolic form:
    If a person is a father, then that person is a male.
    p→q
    BICONDITIONAL

    – true if the statement is still true when the


    antecedent and consequent are reversed.
    – The compound statement “p if and only if q”
    (abbreviated as iff ) is symbolized by p ↔ q.
    NEGATION

    – The negation of a statement


    – is “not p” and is symbolized ~p
    – no, not, nor
    EXAMPLE:

    – It is not snowing.
    ~p
    – It is after 5 P.M. and they are not working.
    p ∧ ~q
    EXAMPLE:

    – The bill receives majority approval or the bill


    does not become a law.
    p ∨ ~q
    – If a person is not a male, then that person is
    not a father.
    ~q → p
    Statements of Symbolic Logic

    Name Symbolic Form Common English Translations

    Negation ~p Not p. It is not true that p.

    Conjunction p∧q p and q, p but q

    Disjunction p∨q p or q.
    p is sufficient for q, q is
    Conditional p → q If p, then q, necessary for p.
    IDENTIFY THE FOLLOWING:

    1. A student misses lecture.


    2. Kato is a dog and Kato is a mammal.
    3. Either Richmond is in Virginia or Richmond is in Norway.
    4. A person is a bachelor if and only if that person is an
    unmarried male.
    5. A person is a father only if that person is a male.
    SYMBOLIC FORM
    TO
    ENGLISH TRANSLATION
    Common English
    Name Symbolic Form Translations
    Negation ~p Not p. It is not true that p.

    Conjunction p∧q p and q, p but q

    Disjunction p∨q p or q.
    p is sufficient for q, q is
    Conditional p → q If p, then q,
    necessary for p.
    p ↔ q p if and p is necessary and
    Biconditional
    only if q sufficient for q.
    EXAMPLE:
    Negation
    – Let p: I fail the course.
    – Let q: I study hard.
    – In words, what is:
    – ~p
    – I will not fail the course.

    – ~q
    – I don’t study hard.
    EXAMPLE:
    Conjunction and Disjunction
    – Let p: The house is for sale
    – Let q: We can afford to buy the house

    – In words, what is:


    – p ∧ ~q
    – The house is for sale and we cannot afford to buy the house.
    – ~p V ~q
    – The house is not for sale or we cannot afford to buy the house.
    EXAMPLE:
    Conditional
    – Let p: I do my homework
    – Let q: I get my allowance.

    – In words, what is:


    – p→q
    – If I do my homework then, I get my allowance.
    EXAMPLE:
    Biconditional
    – Let p: Today is Tuesday
    – Let q: Yesterday was Monday.

    – In words, what is:


    – p↔q
    – If today is Tuesday, then yesterday was Monday.
    – If yesterday was Monday, then today is Tuesday.

    You might also like