hw2solutions

# hw2solutions - EE 369 HW#2 Solutions(Sixth Edition Section...

This preview shows pages 1–2. Sign up to view the full content.

EE 369 HW #2 Solutions (Sixth Edition) Section 1.3 1) a. true b.false c. false d. true 2) e. false f.true g.true h. false 9) d. (\exists x) (D(x) ^ S(x) ^ R(x)) e. (\forall x) (D(x) --> S'(x) V R'(x) ) f. (\forall x) (D(x) ^ S(x) --> D(x)^R(x) ) g. (\forall x) (D(x) --> S'(x)) h. S(M) --> (\forall x)(D(x)-->S(x)) i. R(M) ^ R(T) j. (\exists x) (D(x) ^ R(x))--> (\forall y)(D(y) --> S(y)) 15) c. \forall x \forall y ( P(x) ^ S(y,x) --> C(y) ) d. \forall x (F(x) ->(\exists y)(C(y) ^ S(x,y))) e. \exists x P(x) ^ [(\exists y) C(y) ^ S(x,y)]' f. \exists x \exists y \forall z \forall w ( C(x)^F(y)^S(x,y) --> ( C(z) ^ F(w)--> S(z,w) )) 18) c. All women love only handsome men. d. There is a handsome man who loves Kathy. e. Some pretty woman loves only handsome men. f. John loves all pretty women. 24) a. Reordering consecutive quantifiers of the same type does not change the meaning of a wff. Whether objects a and b make A(a,b) true does not depend on which order we select a and b, but only on the identity of a and b. b. Reordering consecutive quantifiers of the same type does not

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

hw2solutions - EE 369 HW#2 Solutions(Sixth Edition Section...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online