Question 1 1- Use the logical equivalencies to prove the logical equivalence of the following statements, $\neg(p \lor \neg q) \lor (\neg p \land \neg q) = \neg p$ Please show your work for full credit.
Added by Kelly B.
Close
Step 1
Step 1: ¬(pV¬q) V (¬p^¬q) = ¬p Step 2: ¬(pV¬q) V (¬p^¬q) = (¬p^q) V (¬p^¬q) (De Morgan's Law) Step 3: (¬p^q) V (¬p^¬q) = ¬p ^ (qV¬q) (Distributive Law) Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 80 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use the logical equivalences to show that (¬q ∧ (p → q)) → ¬p is a tautology.
Sri K.
equivalnce quesion
Keondre P.
Use a truth table to prove that
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD