midsol - CS123 Spring 2010 Solution to Midterm Problem 1...

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

View Full Document Right Arrow Icon
CS123 Spring 2010 Solution to Midterm Problem 1 (25 points) Let p , q be two propositions. We define the following operation, denoted ± , as: p ± q = ( p q ) ( p q ) a) Show the truth table of ± . Solution : p q p q ( p q ) p ± q 0 0 1 0 0 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 b) Prove that p ± F = p and p ± T = p where F and T are “false” and “true,” respectively. Solution : p ± F = ( p F ) ( p F ) by the definition of operation ± = ( p T ) p by identity law = T p by domination law = p by identity law p ± T = ( p T ) ( p T ) by the definition of operation ± = ( p F ) T by domination law = p T by identity law = p by identity law c) Prove that p ± q = p ± q . (Note: you can do (b) and (c) by truth tables, but they can be done in a faster way.) Solution : p ± q = ( p q ) ( p q ) by the definition of operation ± = ( p q ) ( p q ) by double negation law = ( p q ) ( p q ) by commutative law = ( p q ) ( p q )
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 document was uploaded on 10/01/2011.

Page1 / 3

midsol - CS123 Spring 2010 Solution to Midterm Problem 1...

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