O'Reilly logo

Discrete Structures, Logic, and Computability, 4th Edition by James L. Hein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 6

Section 6.2

1. a. ( ( ¬ P ) Q ) ( P R ) .

c. A ( B ( ( ( ¬ C ) D ) E ) ) ) F .

2. a. ( P Q ¬ R ) ¬ Q R P .

3. ( A B ) ( ¬ A C ) o r ( A B ) ( ¬ A C ) .

5. A ¬ B F a l s e ¬ ( A ¬ B ) F a l s e ¬ ( A ¬ B ) ¬ A ¬ ¬ B ¬ A B A B.

7. a. If B = True, then the wff is true. If B = False and A = True, then the wff is false.

c. If A = True, then the wff is true. If A = False and C = True, then the wff is false.

e. If B = True, then the wff is true. If B = False and A = C = True, then the wff is false.

8. a. If C = True, A → C is true, so the wff is trivially true too. If C = False, then the wff becomes (A → B) ∧ (B → False) (A → False), which is equivalent ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required