×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 1.1 - Problem 40e
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 1.1 - Problem 40e

×

# Explain, without using a truth table, is true when p ,q,

ISBN: 9780073383095 37

## Solution for problem 40E Chapter 1.1

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 283 Reviews
28
1
Problem 40E

Explain, without using a truth table, why (p ∨¬q) ∧ (q ∨¬r) ∧ (r ∨¬p) is true when p, q, and r have the same truth value and it is false otherwise.

Step-by-Step Solution:

Solution:

Step 1:

In this problem we need to explain without  using a truth table , is true when p,q and r have the same truth value and it is false otherwise.

Given: is true. When p , q, and r have the same truth value  and it is false otherwise.

Conjunction : If p and q are statements , then the statement  (read p and q)  is true  only when both p and q are true , and is false otherwise.

Disjunction:  If p and q are statements , then the statement (read p or q)  is true  when at least  one of the two statements  is true , and is false when both are false.

Negation:Let P stand for a given statement.Thenrepresents the logical opposite of P. When P is true, then  is false and vice versa.

Step 2 of 4

Step 3 of 4

#### Related chapters

Unlock Textbook Solution