Scribd
Upload
325 views1 page

Discrete Mathematics For Computer Science

This document contains a problem set for a discrete mathematics course. It includes 5 problems: 1) Complete a truth table for statements involving quantifiers. 2) Translate negated statements involving quantifiers into predicate logic formulas. 3) Translate an English statement about regular languages into predicate logic. 4) Convert a logic formula into conjunctive normal form. 5) Specify logic formulas that are satisfiable if and only if a tiling problem instance is solvable.

Uploaded by

brook denison
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
325 views1 page

Discrete Mathematics For Computer Science

This document contains a problem set for a discrete mathematics course. It includes 5 problems: 1) Complete a truth table for statements involving quantifiers. 2) Translate negated statements involving quantifiers into predicate logic formulas. 3) Translate an English statement about regular languages into predicate logic. 4) Convert a logic formula into conjunctive normal form. 5) Specify logic formulas that are satisfiable if and only if a tiling problem instance is solvable.

Uploaded by

brook denison
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

ECS 20: Discrete Mathematics for Computer Science UC Davis Phillip Rogaway

Handout 3 October 7, 2008

Problem Set 3 Due Monday, October 13, 2008


1. (Velleman, p. 64, problems 8 and 9.) Complete the following table, answering whether the statement is true (True) or false (False) when the universe of discourse is as indicated. R xy(2x y = 0) yx(2x y = 0) xy(x 2y = 0) x(x < 10 y(y < x y < 9)) yz(y + z = 100) xy(y > x z(y + z = 100)) 2. (Velleman, p. 72, problem 2.) Translate the negation of the following statements into formulas of quantication logic, introducing predicates as needed. (a) There is someone in the freshman class who doesnt have a roommate. (b) Everyone likes someone, but no one likes everyone. (c) (a A)(b B)(a C b C) (d) (y > 0)(x)(ax2 + bx + c = y) 3. Translate the following into a formula of the predicate calculus. A language L that is regular will have the following property: there will be some number N (that depends on L) such that if s is a string in L (a string is a sequence of characters) whose length is at least N then s can be written as xyz where y is not the empty string and xy i z is in the language L for every nonnegative integer i. Note 1: you do not have to understand this statement to do this problem. Note 2: you will see this specic statement again in ECS 120. 4. A well-formed formula is said to be in conjunctive normal form (CNF) if it is the conjunct (and) of terms where each term is the disjunct (or) of variables or their complements. Convert the following formula into CNF: = A (B C). Can every formula be converted into a logically equivalent one in CNF? Explain your answer. 5. In class we described the problem TILING, where you are given a collection of t tile types, 1, . . . , t, and Boolean functions S(k, k ) and T (k, k ) with the following semantics: S(k, k ) is true i a tile of type k may be put immediately to the left of a tile of type k , and T (k, k ) is true i a tile of top k may be put immediately beneath a tile of type k . Explicitly specify a collection of formulas such that is satisable (meaning that there is a truth assignment that satises every formula in ) i the upper quadrant of the plane is tilable according to the S and T constraints. Z

You might also like