/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 37 Write the negation of each state... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 3: Problem 37

Write the negation of each statement. \(p \wedge(q \vee r)\)

Short Answer

Expert verified
The negation of the statement \(p \wedge(q \vee r)\) is \(\neg p \vee (\neg q \wedge \neg r)\).

Step by step solution

01

Applying De Morgan's Laws

Re-write the statement \(p \wedge(q \vee r)\) into its negation form using De Morgan's laws. The negation of a conjunction (and) becomes a disjunction (or), and the negation of a disjunction (or) becomes a conjunction (and). Though it's not necessary to distribute the negation over \(q \vee r\) since it's already a disjunction.
02

Distributing the Negation

The negation needs to be distributed over both \(p\) and \((q \vee r)\) which implies \(\neg p \) and \(\neg(q \vee r)\).
03

Applying De Morgan's Laws Again

In \(\neg(q \vee r)\), De Morgan's law again needs to be applied to \(q \vee r\) as it's a disjunction. Hence the negation of \(q \vee r\) becomes \(\neg q \wedge \neg r\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Translate each argument into symbolic form. Then determine whether the argument is valid or invalid. You may use a truth table or, if applicable, compare the argument's symbolic form to a standard valid or invalid form. (You can ignore differences in past, present, and future tense.) If some journalists learn about the invasion, the newspapers will print the news. If the newspapers print the news, the invasion will not be a secret. The invasion was a secret. \(\therefore\) No journalists learned about the invasion.

Translate each argument into symbolic form. Then determine whether the argument is valid or invalid. You may use a truth table or, if applicable, compare the argument's symbolic form to a standard valid or invalid form. (You can ignore differences in past, present, and future tense.) If I'm tired, I'm edgy. If I'm edgy, I'm nasty. \(\therefore\) If I'm tired, I'm nasty.

Use Euler diagrams to determine whether each argument is valid or invalid. All humans are warm-blooded. No reptiles are warm-blooded. Therefore, no reptiles are human.

Determine whether each argument is valid or invalid. No \(A\) are \(B\), some \(A\) are \(C\), and all \(C\) are \(D\). Thus, some \(D\) are \(B\)

Use a truth table to determine whether the symbolic form of the argument is valid or invalid. $$ \begin{aligned} &p \rightarrow q \\ &\underline{q \rightarrow r} \\ &\therefore r \rightarrow p \end{aligned} $$
See all solutions

Recommended explanations on Math Textbooks

Discrete Mathematics

Read Explanation

Calculus

Read Explanation

Geometry

Read Explanation

Theoretical and Mathematical Physics

Read Explanation

Decision Maths

Read Explanation

Statistics

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.