recategorized by
8,151 views
23 votes
23 votes

The proposition $p \wedge (\sim p \vee q)$ is:

  1. a tautology

  2. logically equivalent to $p \wedge q$

  3. logically equivalent to $p \vee q$

  4. a contradiction

  5. none of the above

recategorized by

4 Answers

Best answer
29 votes
29 votes

$p \wedge (\sim p \vee q)$

$\equiv (p \wedge \sim p) \vee (p \wedge q)$

$\equiv F \vee (p \wedge q)$

$\equiv (p \wedge q)$


Hence, Option(B) logically equivalent to $ (p \wedge q)$.

edited by
3 votes
3 votes
$P \wedge (\neg P \vee Q ) \equiv  ( P \wedge \neg P ) \vee ( P \wedge Q )$

                         $\equiv F \vee ( P \wedge Q )\:\:\: \bigg[\because (P \wedge \neg P) \: \text{ is always False and} \: (P \vee \neg P)\:\text{ is always True} \bigg]$

                        $\equiv ( P \wedge Q )$
edited by
Answer:

Related questions

18 votes
18 votes
3 answers
1
Kathleen asked Sep 29, 2014
3,130 views
Show that proposition $C$ is a logical consequence of the formula$$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$$using truth tables....
41 votes
41 votes
5 answers
2
Kathleen asked Sep 29, 2014
12,589 views
$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is:$O(n)$$O(n^2)$$O(n^3)$$O(3n^2)$$O(1.5n^2)$
28 votes
28 votes
3 answers
3
Kathleen asked Sep 29, 2014
4,395 views
Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is$m^n$$^nP_m$$^mC_n$$^nC_m$$^mP_n$