Homework 4, CMSC250, Spring 2004, Assignments of Discrete Structures and Graph Theory

Information about a homework assignment for a computer science course, cmsc250, given in spring 2004. The assignment includes proofs, translations into formal language, and deciding the validity of arguments. It also includes situations where symbolic expressions must be determined.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-yuh
koofers-user-yuh 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMSC250, Spring 2004 Homework 4
Due Wednesday, February 25 at the beginning of your discussion section.
You must write the solutions to the problems single-sided on your own lined
paper, with all sheets stapled together, and with all answers written in sequential
order or you will lose points.
1. Complete the following proofs using the method described in class (line numbers, rules,
etc).
(a)
P1 xD P (x)(T(x)Q(x))
P2 yD Q(y)(R(y)P(y))
P3 zD(T(z)R(z)) S(z)
wDQ(w)S(w)
(b)
P1 tD(A(t)B(t)) (C(t)D(t))
P2 uDA(u)(D(u)E(u))
P3 vDE(v)(C(v)A(v))
hDB(h)E(h)
(c)
P1 wD J(w)M(w)
P2 xD M(x)((N(x)→∼ J(x)) K(x))
P3 yD N(y) L(y)
P4 zD(J(z)K(z)) (L(z)M(z))
qDJ(q)
2. Translate each of the following into formal language using the sets and predicates given.
(a) Exactly two people completely understand quantum physics. (U={universal
set},P(m) = mis a person, Q(n) = ncompletely understands quantum physics.)
(b) I own at least three cats. (C={all cats},N(x) = I own x.)
(c) No more than two people own both a kangaroo and a polar bear. (P={all
people},K(p) = powns a kangaroo, B(p) = powns a polar bear.)
3. For each of the following, decide if the argument is valid or invalid, and write “invalid”
or “valid” as appropriate. If it is invalid, draw an Euler diagram to verify this fact.
If it is valid, draw an Euler diagram that shows the premises and conclusion all to be
true.
(a) All shortshops can steal bases.
Some shortstops can hit home runs.
Therefore, some shortstops can steal bases and hit home runs.
1
pf2

Partial preview of the text

Download Homework 4, CMSC250, Spring 2004 and more Assignments Discrete Structures and Graph Theory in PDF only on Docsity!

CMSC250, Spring 2004 Homework 4

Due Wednesday, February 25 at the beginning of your discussion section.

You must write the solutions to the problems single-sided on your own lined paper, with all sheets stapled together, and with all answers written in sequential order or you will lose points.

  1. Complete the following proofs using the method described in class (line numbers, rules, etc).

(a)

P1 ∀x ∈ D P (x) → (T (x) ∨ Q(x)) P2 ∀y ∈ D Q(y) ∨ (R(y) ∧ P (y)) P3 ∀z ∈ D (T (z) ∧ R(z)) → S(z) ∴ ∀w ∈ D ∼ Q(w) → S(w)

(b)

P1 ∀t ∈ D (A(t) → B(t)) → (C(t) ∨ D(t)) P2 ∃u ∈ D ∼ A(u) ∧ (D(u) → E(u)) P3 ∀v ∈ D ∼ E(v) → (C(v) → A(v)) ∴ ∃h ∈ D ∼ B(h) ∨ E(h)

(c)

P1 ∀w ∈ D J(w) → M (w) P2 ∀x ∈ D M (x) → ((N (x) →∼ J(x))∧ ∼ K(x)) P3 ∀y ∈ D N (y)∨ ∼ L(y) P4 ∀z ∈ D (J(z) ∧ K(z)) ∨ (L(z) ∧ M (z)) ∴ ∀q ∈ D ∼ J(q)

  1. Translate each of the following into formal language using the sets and predicates given.

(a) Exactly two people completely understand quantum physics. (U = {universal set}, P (m) = m is a person, Q(n) = n completely understands quantum physics.) (b) I own at least three cats. (C = {all cats}, N (x) = I own x.) (c) No more than two people own both a kangaroo and a polar bear. (P = {all people}, K(p) = p owns a kangaroo, B(p) = p owns a polar bear.)

  1. For each of the following, decide if the argument is valid or invalid, and write “invalid” or “valid” as appropriate. If it is invalid, draw an Euler diagram to verify this fact. If it is valid, draw an Euler diagram that shows the premises and conclusion all to be true.

(a) • All shortshops can steal bases.

  • Some shortstops can hit home runs.
  • Therefore, some shortstops can steal bases and hit home runs.

(b) • All CS professors are intelligent.

  • All CS professors like music.
  • Therefore, all intelligent people like music. (c) • Some textbooks are cheap.
  • Some textbooks are useful.
  • Therefore, some textbooks are cheap and useful.
  1. In this problem, you are given a number of situations in English. For each situation, you must determine which symbolic expression(s) from the given list are true in that situation. Let L be the set of people {Kate, Lisa, John}, let M be the set of musical instruments {piano, trumpet, accordian}, and let the predicate P (x, y) mean “person x plays in- strument y.” Symbolic expressions to choose from:

(1) ∀x ∈ L ∃y ∈ M P (x, y) (2) ∃x ∈ L ∀y ∈ M P (x, y) (3) ∀y ∈ M ∃x ∈ L P (x, y) (4) ∃y ∈ M ∀x ∈ L P (x, y)

You may assume that in each situation, each person plays only the instruments listed for him or her, and no others. In other words, if its not listed, they don’t play it! Remember, for each situation, write down the corresponding numbers of all the sym- bolic expressions that apply to that situation. Situations:

(a) John plays piano, Kate plays trumpet, and Lisa plays accordian. (b) John plays piano, Kate plays piano and trumpet, and Lisa plays piano and accor- dian. (c) John plays trumpet, Kate plays piano, trumpet, and accordian, and Lisa doesn’t play anything. (d) John plays trumpet, Kate plays piano and trumpet, and Lisa plays trumpet. (e) John plays trumpet, Kate doesn’t play anything, and Lisa plays piano and accor- dian. (f) John plays accordian, Kate plays piano and accordian, and Lisa plays piano. (g) John plays piano, trumpet, and accordian, Kate plays trumpet and accordian, and Lisa plays accordian. (h) John plays piano and trumpet, Kate plays piano and accordian, and Lisa plays piano, trumpet, and accordian.