Scribd Logo
Upload

Welcome to Scribd!

  • HW1 Solutions

    Uploaded by

    Jacob Martin
    4 views2 pages
    The document summarizes 5 problems from a homework assignment on foundations of computer science. Problem 1 asks to write the truth table for a proposition with 3 variables. Problem 2 asks to find a proposition that is true only when 2 variables are true and 1 is false. Problem 3 asks to find a proposition that is never true. Problem 4 asks to determine if 2 propositions are equivalent by comparing their truth tables, and they are not equivalent. Problem 5 asks to determine the truth values of 3 statements involving quantification and relation P(m,n) meaning m is less than or equal to n.

    Original Description:

    nein

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes 5 problems from a homework assignment on foundations of computer science. Problem 1 asks to write the truth table for a proposition with 3 variables. Problem 2 asks to find a proposition that is true only when 2 variables are true and 1 is false. Problem 3 asks to find a proposition that is never true. Problem 4 asks to determine if 2 propositions are equivalent by comparing their truth tables, and they are not equivalent. Problem 5 asks to determine the truth values of 3 statements involving quantification and relation P(m,n) meaning m is less than or equal to n.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views2 pages

    HW1 Solutions

    Uploaded by

    Jacob Martin
    The document summarizes 5 problems from a homework assignment on foundations of computer science. Problem 1 asks to write the truth table for a proposition with 3 variables. Problem 2 asks to find a proposition that is true only when 2 variables are true and 1 is false. Problem 3 asks to find a proposition that is never true. Problem 4 asks to determine if 2 propositions are equivalent by comparing their truth tables, and they are not equivalent. Problem 5 asks to determine the truth values of 3 statements involving quantification and relation P(m,n) meaning m is less than or equal to n.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    CSCI 2200 - Foundations of Computer Science Homework #1

    Last modied: February 4, 2013

    Problem 1. (20 points). Write the truth table for the proposition (r q ) (p r). p q r (r T T T T T F T F T T F F F T T F T F F F T F F F Problem 2. (20 points). Find a proposition with three variables p, q , and r that is true when p and r are true and q is false, and false otherwise. (p r q ) Problem 3. (20 points). Find a proposition with three variables p, q , and r that is never true. ((p p) (q q ) (r r)) Problem 4. (20 points). Determine whether (p (q r)) and (p (q r)) are equivalent. We answer this by deriving and comparing the truth tables of the statements. q ) F T T T F T T T (p r) F T F T F F F F (r q ) (p r) T T F T T F F F

    p q r (q r) (q r) (p (q r)) (p (q r)) T T T T T T T T T F F F F F T F T T F T F T F F T F T F F T T T T T T F T F F F T T F F T T F T T F F F T F T T Since the truth table columns of (p (q r)) and (p (q r)) do not match, they are not equivalent. Problem 5. (20 points). Let P (m, n) mean m n where the universe for m and n is the set of nonnegative integers. What is the truth value of the following statements ? 1. n True. P (0, n)

    2. nm P (m, n) False. 3. mn P (m, n) True.

    You might also like