Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Tutorial 2

    Uploaded by

    Joseph Kurian
    This document contains 10 problems related to discrete mathematics concepts like quantifiers, logic, and proofs. The problems cover topics such as expressing quantified statements without quantifiers, determining truth values of quantified statements, using rules of inference to prove conclusions, identifying valid and invalid argument forms, and showing that argument forms are valid.

    Copyright:

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

    Tutorial 2

    Uploaded by

    Joseph Kurian
    13 views2 pages
    This document contains 10 problems related to discrete mathematics concepts like quantifiers, logic, and proofs. The problems cover topics such as expressing quantified statements without quantifiers, determining truth values of quantified statements, using rules of inference to prove conclusions, identifying valid and invalid argument forms, and showing that argument forms are valid.

    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 10 problems related to discrete mathematics concepts like quantifiers, logic, and proofs. The problems cover topics such as expressing quantified statements without quantifiers, determining truth values of quantified statements, using rules of inference to prove conclusions, identifying valid and invalid argument forms, and showing that argument forms are valid.

    Copyright:

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

    Tutorial 2

    Uploaded by

    Joseph Kurian
    This document contains 10 problems related to discrete mathematics concepts like quantifiers, logic, and proofs. The problems cover topics such as expressing quantified statements without quantifiers, determining truth values of quantified statements, using rules of inference to prove conclusions, identifying valid and invalid argument forms, and showing that argument forms are valid.

    Copyright:

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

    Birla Institute of Technology and Science, Pilani-K. K.

    Birla Goa Campus


    Discrete Mathematics - First Semester 2022-2023
    Problem Set 2

    Course No: MATH F213 Instructor: Yasmeen Akhtar

    1. Let x, y be non zero real numbers. Express the negation of the statement ∀x ∃y (xy = 1) so
    that no negation precedes a quantifier, and find its truth value.

    2. Determine the truth value of the following.


    For every integer x there exists a unique integer y such that x2 − (x − 1)2 = 2y + 3.

    3. What are the truth values of these statements where the universe of discourse has 10 distinct
    elements?

    1. ∃!x P (x) → ∃x P (x)


    2. ∀x P (x) → ∃!x P (x)
    3. ∀x P (x) → ∃x P (x)
    4. ∃!x¬P (x) → ¬∀x P (x)

    4. Suppose that the domain of the propositional function P (x) consists of the integers 1, 2, 3, 4,
    and 5. Express the statement ∀x((x 6= 3) → P (x)) ∨ ∃x¬P (x) without using quantifiers,
    instead using only negations, disjunctions, and conjunctions, and determine its truth value.

    5. Use rules of inference to show that the hypotheses “If it does not rain or if it is not foggy,
    then the sailing race will be held and the lifesaving demonstration will go on,” “If the sailing
    race is held, then the trophy will be awarded,” and “The trophy was not awarded” imply the
    conclusion “It rained.”

    6. Use quantifiers to express the definition of the limit of a real-valued function f (x) of a real
    variable x at a point a in its domain.

    7. For each of these arguments determine whether the argument is valid or invalid and explain
    why.
    (a.) All students in this class understand logic. Yash is a student in this class. Therefore,
    Yash understands logic.
    (b.) Every computer science major takes discrete mathematics. Natasha is taking discrete
    mathematics. Therefore, Natasha is a computer science major.
    (c.) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like
    fruit.
    8. Identify the error or errors in this argument that supposedly shows that if ∃xP (x) ∧ ∃xQ(x)
    is true then ∃x(P (x) ∧ Q(x)) is true.

    1. ∃xP (x) ∧ ∃xQ(x) Premise


    2. ∃xP (x) Simplification from (1)
    3. P (c) Existential instantiation from (2)
    4. ∃xQ(x) Simplification from (1)
    5. Q(c) Existential instantiation from (4)
    6. P (c) ∧ Q(c) Conjunction from (3) and (5)
    7. ∃x(P (x) ∧ Q(x)) Existential generalization from (6)

    9. Show that the argument form with premises p1 , p2 , . . . , pn and conclusion q → r is valid if the
    argument form with premises p1 , p2 , . . . , pn , q, and conclusion r is valid.

    10. Show that the argument form with premises (p ∧ t) → (r ∨ s), q → (u ∧ t), u → p, and ¬s
    and conclusion q → r is valid by first using Exercise 9 and then using rules of inference.

    You might also like