Chapter 1: Problem 34
Give an example (other than Example 1.3.14) of an invalid argument with a true conclusion.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! 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}
Learning Materials
Features
Discover
Chapter 1: Problem 34
Give an example (other than Example 1.3.14) of an invalid argument with a true conclusion.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
In logic and in standard English, a double negative is equivalent to a positive. Is there any English usage in which a double positive is equivalent to a negative? Explain.
Indicate which of the following sentences are statements. a. 1,024 is the smallest four-digit number that is a perfect square. b. She is a mathematics major. c. \(128=2^{6}\) d. \(x=2^{6}\)
Some of the arguments in 24-32 are valid, whereas others exhibit the converse or the inverse error. Use symbols to write the logical form of each argument. If the argument is valid, identify the rule of inference that guarantees its validity. Otherwise, state whether the converse or the inverse error is made. If I go to the movies, I won't finish my homework. If I don't finish my homework, I won't do well on the exam tomorrow. \(\therefore\) If I go to the movies, I won't do well on the exam tomorrow.
In 38-41 (a) use the logical equivalences \(p \rightarrow q \equiv \sim p \vee q\) and \(p \leftrightarrow q \equiv(\sim p \vee q) \wedge(\sim q \vee p)\) to rewrite the given statement forms without using the symbol \(\rightarrow\) or \(\leftrightarrow\), and (b) use the logical equivalence \(p \vee q \equiv \sim(\sim p \wedge \sim q)\) to rewrite each statement form using only \(\wedge\) and \(\sim\). $$ (p \rightarrow r) \leftrightarrow(q \rightarrow r) $$
a. Show that the following statement forms are all logically equivalent. \(p \rightarrow q \vee r, \quad p \wedge \sim q \rightarrow r, \quad\) and \(\quad p \wedge \sim r \rightarrow q\) b. Use the logical equivalences established in part (a) to rewrite the following sentence in two different ways. (Assume that \(n\) represents a fixed integer.) If \(n\) is prime, then \(n\) is odd or \(n\) is 2 .
What do you think about this solution?
We value your feedback to improve our textbook solutions.