lect4 - DeMorgans Laws (A B) = A B (A B) = A B A B = (A B )...

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

View Full Document Right Arrow Icon
1 DeMorgan’s Laws ¬ ( A B ) = ¬ A ∩¬ B ¬ ( A B ) = ¬ A ∪¬ B A B ¬ ( A B ) B ¬ B A ¬ A =
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 Example of using DeMorgan’s Law Let A = { a, d , e , g } and B = { c , d , f , g } from the universe U = { a , b , c , d , e , f , g , h , i }. To verify that ¬ ( A B ) = ¬ A ∩¬ B find each of these two sets independently to find that they are indeed the same. 1) ¬ ( A B )= ¬ { a, c , d , e , f , g } = { b , h , i } 2) ¬ A ∩¬ B= { b , c , f , h , i } { a , b , e , h , i } ={ b , h , i } are the same, as predicted.
Background image of page 2
3 Domination Laws A U = U A = Absorption Laws A ( A B ) = A A ( A B ) = A p T T p F F p ( p q ) p p ( p q ) p These laws can be proved by using logic laws or membership tables.
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 In everyday life different kinds of proofs are acceptable: Jury trial. Word of God. Word of Boss. Experimental science: The truth is guesses and confirmed or refuted by experiments. Sampling: like public opinion is obtained by polling. Inner conviction. . These are not valid proofs in mathematical sense. They all can go wrong… What is a proof? A proof is a method of ascertaining truth.
Background image of page 4
5 Mathematics uses a particularly convincing way to argue that something is true. Definition . A proof is a formal verification of a proposition by a chain of logical deductions starting from the base set of axioms . A proof takes axioms and definitions and uses deduction rules, step by step, to get a desired conclusion.
Background image of page 5

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

View Full DocumentRight Arrow Icon
Proof methods If a statement considers a few numbers of cases it can be proved by exhaustive checking . Example : All students in this class are computer science major. We can easily verify is it true or false. Truth table method . To prove a statement about small number Boolean variables make a truth table and check all possible cases. Example : ( p q ) ( ¬ q ¬ p ). By inspection we see that lhs has the same truth value as the rhs
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 07/14/2011.

Page1 / 21

lect4 - DeMorgans Laws (A B) = A B (A B) = A B A B = (A B )...

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

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