# hw2 - CONCORDIA UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE...

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

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.

Unformatted text preview: CONCORDIA UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING COMP232 MATHEMATICS FOR COMPUTER SCIENCE ASSIGNMENT 2 FALL 2010 In each of the problems below it is especially important that your proof (or counter example) is correct, clear, complete, concise, and carefully presented, using proper mathematical notation. Points will be deducted if your presentation does not satisfy these requirements. 1. If the following equivalence is valid then give a proof. If the equivalence is invalid then give a counterexample. parenleftBig ∀ xP ( x ) parenrightBig ∧ parenleftBig ∃ xQ ( x ) parenrightBig ≡ ∀ x ∃ y parenleftBig P ( x ) ∧ Q ( y ) parenrightBig 2. Prove that [( p ∨ q ) ∧ ( p → s ) ∧ ( q → t )] ⇒ s ∨ t , using a direct proof (with cases). 3. Prove that [( p ∨ q ) ∧ ( p → s ) ∧ ( q → t )] ⇒ s ∨ t , using a proof by contradiction. 4. Prove that [( p ∨ q ) ∧ ( p → s ) ∧ ( q → t )] ⇒ s ∨ t , by proving the contrapositive.by proving the contrapositive....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw2 - CONCORDIA UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE...

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

View Full Document
Ask a homework question - tutors are online