Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Express the negation of these propositions using quantifiers, and then express the negation in English.

a) Some drivers do not obey the speed limit.

b) All Swedish movies are serious.

c) No one can keep a secret.

d) There is someone in this class who does not have a good attitude.

Short Answer

Expert verified

a) The statement "Some drivers do not obey the speed limit” expressed using quantifiers would be ¬(x¬P(x))x¬(¬P(x))xP(x)and the negation in simple English can be expressed as “All drivers obey the speed limit ".

b) The statement” All Swedish movies are serious” expressed using quantifiers as¬(xQ(x))x¬Q(x)and the negation in simple English can be expressed as" There is a Swedish movie that is not serious ".

c)The statement “No one can keep a secret “expressed using quantifiers would be ¬(¬xR(x))xR(x)and the negation in simple English can be expressed as " Somebody can keep a secret".

d) The statement "There is someone in this class who does not have a good attitude" expressed using quantifiers as ¬(¬x¬S(x))x¬(¬S(x))xS(x)and the negation in simple English can be expressed as “Everybody in this class has a good attitude ".

Step by step solution

01

INTERPRETATION SYMBOLS

Negation¬p: not p

Conjunctionpq:p and q

Existential quantification xP(x): There exists an element xin the domain such that P(x).

Universal quantification xP(x):P(x)for all values of in the domain.

LOGICAL EQUIVALENCES

Double negation law:

¬(¬p)p

De Morgan's laws:

¬(pq)¬p¬q¬(pq)¬p¬q

De Morgan's Laws for Qualifiers:

¬xP(x)x¬P(x)¬xP(x)x¬P(x)

02

Morgan’s Law

a) Let the domain be drivers and P(x)mean "x obeys the speed limit". We can then rewrite the given statement as:

x¬P(x)

The negation is then by De Morgan's Law for Qualifiers and the double negation law:

¬(x¬P(x))x¬(¬P(x))xP(x)

This means: All drivers obey the speed limit.

b) Let the domain be Swedish movies and Q(x)mean "x is serious". We can then rewrite the given statement as:

xQ(x)

The negation is then by De Morgan's Law for Qualifiers:

¬(xQ(x))x¬Q(x)

This means: There is a Swedish movie that is not serious.

03

Double negation law

c) Let the domain be people and R(x) mean "x can keep a secret". We can then rewrite the given statement as "There is not a person that can keep a secret":

¬xR(x)

The negation is then by the double negation law:

¬(¬xR(x))xR(x)

This means: Somebody can keep a secret.

04

De Morgan’s Law

d) Let the domain be people in this class and S(x) mean "x has a good attitude". We can then rewrite the given statement as:

x¬S(x)

The negation is then by De Morgan's Law for Qualifiers and the double negation law:

¬(x¬S(x))x¬(¬S(x))xS(x)

This means: Everybody in this class has a good attitude.

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 Vaia!

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

Let P(x),Q(x),R(x),andS(x) be the statements “xis a duck,” “xis one of my poultry,” “xis an officer,” and “xis willing to waltz,” respectively. Express each of these statements using quantifiers; logical connectives; andP(x),Q(x),R(x),andS(x).

(a) No ducks are willing to waltz.

(b) No officers ever decline to waltz.

(c) All my poultry are ducks.

(d) My poultry are not officers.

(e) Does (d) follow from (a), (b), and (c)? If not, is there a correct conclusion?

To use the wireless network in the airport you must pay the daily fee unless you are a subscriber to the service. Express your answer in terms of w: “You can use the wireless network in the airport,” d: “You pay the daily fee,” and s: “You are a subscriber to the service.”

How many rows appear in a truth table for each of these compound propositions?

a)\(p \to \neg p\)

b)(p¬r)(q¬s)

c)qp¬s¬r¬tu

d) \((p \wedge r \wedge t) \leftrightarrow (q \wedge t)\)

A says “We are both knaves” and B says nothing. Exercises 24–31 relate to inhabitants of an island on which there are three kinds of people: knights who always tell the truth, knaves who always lie, and spies (called normals by Sullying [Sm78]) who can either lie or tell the truth. You encounter three people, A, B, and C. You know one of these people is a knight, one is a knave, and one is a spy. Each of the three people knows the type of person each of other two is. For each of these situations, if possible, determine whether there is a unique solution and determine who the knave, knight, and spy are. When there is no unique solution, list all possible solutions or state that there are no solutions

A says “I am not the spy,” B says “I am not the spy,” and C says “I am not the spy.”

Suppose that during the most recent fiscal year, the annual revenue of Acme Computer was billion dollars and its net profit was billion dollars, the annual revenue of Nadir Software was billion dollars and its net profit was billion dollars, and the annual revenue of Quixote Media was billion dollars and its net profit was billion dollars. Determine the truth value of each of these propositions for the most recent fiscal year.

  1. Quixote Media had the largest annual revenue.
  2. Nadir Software had the lowest net profit and Acme Computer had the largest annual revenue.
  3. Acme Computer had the largest net profit or Quixote Media had the largest net profit.
  4. If Quixote Media had the smallest net profit, then Acme Computer had the largest annual revenue.
  5. Nadir Software had the smallest net profit if and only if Acme Computer had the largest annual revenue.
See all solutions

Recommended explanations on Math Textbooks

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.

Sign-up for free