s09_t04 - UNIVERSITY OF WATERLOO School of Computer Science...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
UNIVERSITY OF WATERLOO School of Computer Science CS245 Logic and Computation Spring 2009 TUTORIAL 4 1. Express the following English sentences as predicate logic formulas (Exercise 6.4 of text). (a) All second-year students are hardworking. (b) No one can be clever without being hardworking. (c) Clever students work hard. (d) Those who do not work hard are lazy. (e) The lazy students are exactly those who do not work hard. (f) Not being lazy is equivalent to being hardworking. (a) x ( second year ( x ) student ( x )) hardworking ( x ) (b) ¬ ( x clever ( x ) ∧ ¬ hardworking ( x )) (c) x ( clever ( x ) student ( x )) hardworking ( x ) (d) x • ¬ hardworking ( x ) lazy ( x ) (e) x ( lazy ( x ) student ( x )) ⇔ ¬ hardworking ( x ) (f) x • ¬ lazy ( x ) hardworking ( x ) where second year ( x ) is true iF x is in second year student ( x ) is true iF x is a student clever ( x ) is true iF x is clever hardworking ( x ) is true iF x is hardworking lazy ( x ) is true iF x is lazy 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
2. Express the following English sentences as predicate logic formulas (Exercise 6.8 of text). (a) London stores only supply stores outside of London.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/19/2010 for the course CS 246 taught by Professor Wormer during the Spring '08 term at Waterloo.

Page1 / 5

s09_t04 - UNIVERSITY OF WATERLOO School of Computer Science...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online