/*! 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} Free solutions & answers for Thinking Mathematically Chapter 3 - (Page 2) [step by step] | 91Ó°ÊÓ

91Ó°ÊÓ

Problem 12

Use Euler diagrams to determine whether each argument is valid or invalid. All comedians are funny people. Some comedians are professors. Therefore, some funny people are professors.

Problem 16

Let \(p\) and \(q\) represent the following simple statements: \(p\) : This is an alligator. \(q\) : This is a reptile. Write each compound statement in symbolic form. This is a reptile if it's an alligator.

Problem 17

Use Euler diagrams to determine whether each argument is valid or invalid. Some people enjoy reading. Some people enjoy TV. \(\overline{\text { Therefore, some people who enjoy reading enjoy TV. }}\)

Problem 18

Use Euler diagrams to determine whether each argument is valid or invalid. All thefts are immoral acts. \(\underline{\text { Some thefts are justifiable. }}\) Therefore, some immoral acts are justifiable.

Problem 19

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 we close the door, then there is less noise. There is less noise. \(\therefore\) We closed the door.

Problem 21

Use De Morgan's laws to write a statement that is equivalent to the given statement. If you attend lecture and study, you succeed.

Problem 21

Use Euler diagrams to determine whether each argument is valid or invalid. No blank disks contain data. Some blank disks are formatted. Therefore, some formatted disks do not contain data.

Problem 22

Let \(p\) and \(q\) represent the following simple statements: \(p: Y o u\) are human. q: You have feathers. Write each compound statement in symbolic form. Not having feathers is necessary for being human.

Problem 28

Write the converse, inverse, and contrapositive of each statement. If all hard workers are successful, then some people are not hard workers.

Problem 29

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

Access millions of textbook solutions in one place

  • Access over 3 million high quality textbook solutions
  • Access our popular flashcard, quiz, mock-exam and notes features
  • Access our smart AI features to upgrade your learning
Access millions of textbook solutions in one place

Recommended explanations on Math Textbooks