Scribd Logo
Upload

Welcome to Scribd!

  • 163 views

    EECS 203: Discrete Mathematics Fall 2019 Discussion 2 Notes: 1 Definitions

    Uploaded by

    sam
    This document contains notes from Discussion 2 of the EECS 203: Discrete Mathematics course taught in Fall 2019. It includes definitions of logical and quantifier concepts and 7 exercises involving translating statements to predicate logic and using quantifiers and predicates to represent mathematical and everyday language statements. The exercises cover topics like predicates, quantifiers, DeMorgan's laws, and natural deduction proofs.

    Copyright:

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

    EECS 203: Discrete Mathematics Fall 2019 Discussion 2 Notes: 1 Definitions

    Uploaded by

    sam
    163 views3 pages
    This document contains notes from Discussion 2 of the EECS 203: Discrete Mathematics course taught in Fall 2019. It includes definitions of logical and quantifier concepts and 7 exercises involving translating statements to predicate logic and using quantifiers and predicates to represent mathematical and everyday language statements. The exercises cover topics like predicates, quantifiers, DeMorgan's laws, and natural deduction proofs.

    Original Title

    Discussion 2 Fall 2019

    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 contains notes from Discussion 2 of the EECS 203: Discrete Mathematics course taught in Fall 2019. It includes definitions of logical and quantifier concepts and 7 exercises involving translating statements to predicate logic and using quantifiers and predicates to represent mathematical and everyday language statements. The exercises cover topics like predicates, quantifiers, DeMorgan's laws, and natural deduction proofs.

    Copyright:

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

    EECS 203: Discrete Mathematics Fall 2019 Discussion 2 Notes: 1 Definitions

    Uploaded by

    sam
    This document contains notes from Discussion 2 of the EECS 203: Discrete Mathematics course taught in Fall 2019. It includes definitions of logical and quantifier concepts and 7 exercises involving translating statements to predicate logic and using quantifiers and predicates to represent mathematical and everyday language statements. The exercises cover topics like predicates, quantifiers, DeMorgan's laws, and natural deduction proofs.

    Copyright:

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

    EECS 203: Discrete Mathematics

    Fall 2019
    Discussion 2 Notes
    1 Definitions
    • Predicate:

    • Universal quantifier:

    • Existential quantifier:

    • Nested Quantifiers:

    • DeMorgan’s Laws for Quantifiers:

    • Proof by Natural Deduction:

    2 Exercises
    1. Exercise 1.4.12
    Let Q(x) be the statement “x + 1 > 2x”. If the domain consists of all integers, what are
    these truth values?

    a) Q(0)

    b) Q(−1)

    c) Q(1)

    d) ∃xQ(x)

    e) ∀xQ(x)

    f) ∃x¬Q(x)

    g) ∀x¬Q(x)

    1
    2. Exercise 1.4.25
    Let P (x) be “x is perfect”; let F (x) be “x is your friend”; and let the domain (universe of
    discourse) be all people. Translate each of these statements into logical expressions using
    predicates, quantifiers, and logical connectives.

    a) No one is perfect.

    b) Not everyone is perfect.

    c) All your friends are perfect.

    d) At least one of your friends is perfect

    e) Everyone is your friend and is perfect.

    f) Not everybody is your friend or someone is not perfect.

    3. Exercise 1.4.40
    Translate these system specifications into English where the predicate S(x, y) is “x is in
    state y” and where the domain for x and y consists of all systems and all possible states,
    respectively.

    a) ∃xS(x, open)

    b) ∀x(S(x, malfunctioning) ∨ S(x, diagnostic))

    c) ∃xS(x, open) ∨ ∃xS(x, diagnostic)

    d) ∃x¬S(x, available)

    e) ∀x¬S(x, working)

    4. Exercise 1.5.4
    Let P(x, y) be the statement “Student x has taken class y,” where the domain for x consists
    of all students in your class and for y consists of all computer science courses at your school.
    Express each of these quantifications in English.

    a) ∃x∃yP (x, y)

    b) ∃x∀yP (x, y)

    c) ∀x∃yP (x, y)

    2
    d) ∃y∀xP (x, y)

    e) ∀y∃xP (x, y)

    f) ∀x∀yP (x, y)

    5. Exercise 1.5.23
    Express each of these mathematical statements using predicates, quantifiers, logical connec-
    tives, and mathematical operators.

    a) The product of two negative real numbers is positive.

    b) The difference of a real number and itself is zero.

    c) Every positive real number has exactly two square roots.

    d) A negative real number does not have a square root that is a real number.

    6. Exercise 1.5.31
    Express the negations of each of these statements.

    a) ∀x∃y∀zT (x, y, z)

    b) ∀x∃yP (x, y) ∨ ∀x∃yQ(x, y)

    c) ∀x∃y(P (x, y) ∧ ∃zR(x, y, z))

    d) ∀x∃y(P (x, y) → Q(x, y))

    7. Not in Book 1
    Using ONLY Natural Deduction, prove

    (p → q) ∨ q
    p→q

    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