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

Info iconThis preview shows pages 1–2. 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 ASSIGNMENT 1 (Due: Thursday, May 21, 2009 at 5:00pm) Use makeCover to produce a cover page for your assignment and hand in your assignment in the CS245 assignment box. Assignments are to be done individually. 1. (2 marks) Insert brackets into the following formulae so that we do not have to rely on the associativity and order of precedence of the logical connectives to understand the formulae. (a) p q ⇔ ¬ p ⇒ ¬ q p (b) a b c d e 2. (3 marks) Assuming standard rules of precedence and associativity, are the following well-formed for- mulae? If not, explain why not. (a) p q ¬ r (b) ¬ p ⇒ ¬ q (c) p ¬ ⇒ ¬ q 3. (6 marks) Express the following sentences as propositional formulas. Show the English phrase that your propositional symbols represent (e.g., p – “it is raining”).
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
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 / 2

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

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

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