Chapter 1

Discrete Mathematics with Applications · 288 exercises

Problem 64

Determine the truth value of each, where \(P(s)\) denotes an arbitrary predicate. $$(\forall x) \mathrm{P}(x) \rightarrow(\exists ! x) \mathrm{P}(x)$$

4 step solution

Problem 65

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ \left(p^{\prime}\right)^{\prime} $$

5 step solution

Problem 65

Determine whether or not each is a contradiction. $$\sim p \leftrightarrow(p \vee \sim p)$$

5 step solution

Problem 66

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ p \wedge q $$

3 step solution

Problem 66

Indicate the order in which each logical expression is evaluated by properly grouping the operands using parentheses. $$p \vee q \wedge r$$

2 step solution

Problem 66

Determine the truth value of each, where \(\mathrm{P}(\mathrm{s})\) denotes an arbitrary predicate. $$(\forall x) P(x) \rightarrow(\exists x) P(x)$$

4 step solution

Problem 66

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$p \wedge q$$

3 step solution

Problem 66

Determine the truth value of each, where \(P(s)\) denotes an arbitrary predicate. $$(\forall x) \mathrm{P}(x) \rightarrow(\exists x) \mathrm{P}(x)$$

3 step solution

Problem 67

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ p \vee r $$

3 step solution

Problem 67

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$p \vee r$$

4 step solution

Problem 67

Determine the truth value of each, where \(P(s)\) denotes an arbitrary predicate. $$(\exists ! x) P(x) \rightarrow(\exists ! y) P(y)$$

2 step solution

Problem 68

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ q \vee q $$

3 step solution

Problem 68

Indicate the order in which each logical expression is evaluated by properly grouping the operands using parentheses. $$p \vee q \leftrightarrow \sim p \wedge \sim q$$

5 step solution

Problem 68

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$q \vee q^{\prime}$$

4 step solution

Problem 68

Define the quantifier \(\exists !\) in terms of the quantifiers \(\exists\) and \(\forall\).

5 step solution

Problem 69

Indicate the order in which each logical expression is evaluated by properly grouping the operands using parentheses. $$p \rightarrow q \leftrightarrow \sim p \vee q$$

4 step solution

Problem 70

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ p^{\prime} \vee q $$

4 step solution

Problem 70

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$p^{\prime} \vee q$$

3 step solution

Problem 71

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ (p \wedge q)^{\prime} $$

3 step solution

Problem 71

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$(p \wedge q)^{\prime}$$

5 step solution

Problem 72

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ p^{\prime} \vee q^{\prime} $$

3 step solution

Problem 72

Draw a switching network with each representation. $$(\mathrm{A} \vee \mathrm{B}) \wedge(\mathrm{A} \vee \mathrm{C})$$

4 step solution

Problem 72

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$p^{\prime} \vee q^{\prime}$$

2 step solution

Problem 73

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ (p \vee q)^{\prime} $$

3 step solution

Problem 73

Draw a switching network with each representation. $$\left(A \vee B^{\prime}\right) \vee(A \vee B)$$

7 step solution

Problem 73

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$(p \vee q)^{\prime}$$

3 step solution

Problem 74

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ p \wedge q $$

3 step solution

Problem 74

Draw a switching network with each representation. $$\left(\mathbf{A} \wedge \mathbf{B}^{\prime}\right) \vee\left(\mathbf{A}^{\prime} \wedge \mathbf{B}\right)$$

5 step solution

Problem 74

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$p \wedge q^{\prime}$$

3 step solution

Problem 75

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ q \vee r^{\prime} $$

4 step solution

Problem 75

Draw a switching network with each representation. \((A \wedge B) \vee\left(A^{\prime} \wedge B\right) \vee\left(B^{\prime} \wedge C\right)\)

5 step solution

Problem 75

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) $$q \vee r^{\prime}$$

4 step solution

Problem 76

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . $$ (p \vee q) \wedge\left(p^{\prime} \vee q\right) $$

5 step solution

Problem 77

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . Let \(p\) be a simple proposition with \(t(p)=x\) and \(p^{\prime}\) its negation. Find each. $$ t\left(p \vee p^{\prime}\right) $$

4 step solution

Problem 77

Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) \(0.5 .\) Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\)Let \(p\) be a simple proposition with \(t(p)=x\) and \(p^{\prime}\) its negation. Find each. $$t\left(p \vee p^{\prime}\right)$$

5 step solution

Problem 77

After reaching the bus terminal at the capital, Ellen saw three personal computers. She asked a young woman, I, whether the computers had Internet connections. She replied, "Computer 1 is not connected to the Internet. Ask that man, J; he is a knight." When Ellen approached the man, he told her, "Computer 2 has an Internet connection, but computer 3 does not." A second man, K, who overheard the conversation, then said, "If computer 2 has an Internet connection, then so does computer \(1 .\) Computer 3 is not connected to the Internet." Which computer had an Internet connection?

4 step solution

Problem 78

Exercises \(65-78\) deal with propositions in fuzzy logic. Let \(p, q,\) and \(r\) be simple propositions with \(t(p)=1, t(q)=0.3,\) and \(t(r)=\) 0.5 . Compute the truth value of each, where \(s^{\prime}\) denotes the negation of the statement \(s\) . Let \(p\) be a simple proposition with \(t(p)=x\) and \(p^{\prime}\) its negation. Find each. $$ t\left(p \wedge p^{\prime}\right) $$

3 step solution

Problem 78

At the bus terminal, Ellen overheard the following conversation between two baseball fans, L and M: L: I like the Yankees. M: You do not like the Yankees. You like the Dodgers. L: We both like the Dodgers. Does fan L like the Yankees? Who likes the Dodgers?

5 step solution

Show/ page