s09_t05_06

s09_t05_06 - UNIVERSITY OF WATERLOO School of Computer...

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 TUTORIALS 5 and 6 1. Show that x p ( x ) m ( x ), x h ( x ) p ( x ) 6| = x m ( x ) h ( x ). In other words, show that x m ( x ) h ( x ) does not logically follow from the premises. To show that the conclusion does not logically follow from the premises, we must find an interpretation in which the premises are true but the conclusion is false. I.e., we must find a counter example. It is a good idea when looking for a counter example to start with small domains of discourse. So, let the domain of discourse D = { A } . Consider the following interpretation: m (A) is true h (A) is false p (A) is true We can verify that the premises are true in this interpretation but the conclusion is false. 2. Transformational proof of ¬ ( x p ( x ) ∨ ∃ x q ( x )) WV x • ¬ p ( x ) ∧ ¬ q ( x ) ¬ ( x p ( x ) ∨ ∃ x q ( x )) WV ¬ ( x p ( x ) q ( x )) -Distrib- WV x • ¬ ( p ( x ) q ( x )) De Morgan WV x • ¬ p ( x ) ∧ ¬ q ( x ) De Morgan 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
3. Natural Deduction for Predicate Logic The next two examples involve redoing examples used in the Nissanke text in the style of sub-proofs and without the logical laws of transformational proof. They are quite challenging.
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_t05_06 - UNIVERSITY OF WATERLOO School of Computer...

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