search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
17 votes
1.8k views

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

in Mathematical Logic
edited by
1.8k views
0
why not option a? it is modus ponens clearly and hence it is a tautology... pls pls clear my doubt...
0
modus ponens is an inference rule to conclude something.. It is not used to show tautology. Here, put 'P'  as False. It is not a tautology.

4 Answers

18 votes
 
Best answer

$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
0
why not option a? it is modus ponens clearly and hence it is a tautology... pls pls clear my doubt...
13 votes
OPTION (B)
11 votes
p ^ (~p v q)

= (p ^ ~p) v (p ^ q)

= False V (p^q)

= (p^q)
1 vote
$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

8 votes
3 answers
1
1.1k 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.
asked Sep 30, 2014 in Mathematical Logic Kathleen 1.1k views
27 votes
6 answers
2
3.2k 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)$
asked Sep 30, 2014 in Algorithms Kathleen 3.2k views
15 votes
3 answers
3
1.4k 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$
asked Sep 30, 2014 in Set Theory & Algebra Kathleen 1.4k views
13 votes
3 answers
4
2.2k views
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
asked Sep 30, 2014 in Set Theory & Algebra Kathleen 2.2k views
...