Chapter 1: Problem 40
Construct a truth table for \(((p \rightarrow q) \rightarrow r) \rightarrow s\)
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 40
Construct a truth table for \(((p \rightarrow q) \rightarrow r) \rightarrow s\)
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
Find a common domain for the variables \(x, y, z,\) and \(w\) for which the statement \(\forall x \forall y \forall z \exists w((w \neq x) \wedge\) \((w \neq y) \wedge(w \neq z) )\) is true and another common domain for these variables for which it is false.
Suppose that \(a\) and \(b\) are odd integers with \(a \neq b .\) Show there is a unique integer \(c\) such that \(|a-c|=|b-c|\)
Let \(Q(x)\) be the statement " \(x+1>2 x\) . If the domain consists of all integers, what are these truth values? $$ \begin{array}{llll}{\text { a) }} & {Q(0)} & {\text { b) } Q(-1)} & {\text { c) }} \quad {Q(1)} \\ {\text { d) }} & {\exists x Q(x)} & {\text { e) } \quad \forall x Q(x)} & {\text { f) } \quad \exists x \neg Q(x)}\end{array} $$ g) \(\quad \forall x \neg Q(x)\)
For each of these arguments determine whether the argument is correct or incorrect and explain why. a) All students in this class understand logic. Xavier is a student in this class. Therefore, Xavier understands logic. b) Every computer science major takes discrete math- ematics. Natasha is taking discrete mathematics. Therefore, Natasha is a computer science major. c) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like fruit. d) Everyone who eats granola every day is healthy. Linda is not healthy. Therefore, Linda does not eagranola every day.
Exercises \(61-64\) are based on questions found in the book Symbolic Logic by Lewis Carroll. Let P(x), Q(x), R(x), and S(x) be the statements 鈥渪 is a baby,鈥 鈥渪 is logical,鈥 鈥渪 is able to manage a crocodile,鈥 and 鈥渪 is despised,鈥 respectively. Suppose that the domain consists of all people. Express each of these statements using quantifiers; logical connectives; and P(x), Q(x), R(x), and S(x). a) Babies are illogical. b) Nobody is despised who can manage a crocodile. c) Illogical persons are despised. d) Babies cannot manage crocodiles. e) Does (d) follow from (a), (b), and (c)? If not, is there a correct conclusion?
What do you think about this solution?
We value your feedback to improve our textbook solutions.