edited by
15,141 views

6 Answers

Best answer
51 51 votes
Another way to solve it...

Implication $A\to B$ is not tautology if $B$ is false and $A$ is true.

For b option Let RHS ie. $b\to (a\wedge c)$ be false ie $b$ is false and $(a\wedge c)$ is false.

Now, $a \wedge c$ is false if either one of them is false.

Now, if $a$ and $c$ both are false then $a\to c$ is true. LHS is $\text{true}$ and RHS is $\text{false}.$

So option b is not tautology.
edited by
29 29 votes
$A.\ \ ((a \rightarrow b) \wedge (b \rightarrow c)) \rightarrow (a \rightarrow c)$

$\equiv (( \sim a \vee b) \wedge (\sim b \vee c)) \rightarrow (\sim a \vee c)$

$\equiv \sim (( \sim a \vee b) \wedge (\sim b \vee c)) \vee (\sim a \vee c)$

$\equiv (( a \ \wedge \sim b) \vee ( b \wedge \sim c)) \vee (\sim a \vee c)$

$\equiv (\sim a \vee ( a \ \wedge \sim b) )\vee( ( b \wedge \sim c) \vee c)$

$\equiv( (\sim a \vee a )\wedge(\sim a \vee \sim b) )\vee( ( b \vee c) \wedge( \sim c\vee c))$

$\equiv(T\wedge(\sim a \vee \sim b) )\vee( ( b \vee c) \wedge T)$

$\equiv\sim a \vee (\sim b \vee b) \vee c$

$\equiv\sim a \vee T \vee c$

$\equiv T$

 

$B.\ \ (a \rightarrow c)\rightarrow (\sim b \rightarrow(a \wedge c))$

$\equiv \sim(\sim a \vee c)\vee (( b \vee (a \wedge c))$

$\equiv ( a \wedge \sim c)\vee (( b \vee (a \wedge c))$

$\equiv (( a \wedge \sim c)\vee ( a \wedge c) )\vee b$

$\equiv (a \wedge(c \vee \sim c))\vee b$

 $\equiv a \vee b $
 

$C. \ \ (a\wedge b \wedge c) \rightarrow(c \vee a)$

$\equiv \sim(a\wedge b \wedge c) \vee (c \vee a)$

$\equiv \sim a \sim b \sim c \vee c \vee a$

$\equiv (a\vee\sim a )\vee \sim b \vee(\sim c \vee c)$

$\equiv T\vee \sim b \vee T$

$\equiv T$

 

$D.\ \ a\rightarrow (b\rightarrow a)$

$\equiv\sim a \vee (\sim b \vee a)$

$\equiv(\sim a\vee a)\vee \sim b$

$\equiv T \vee \sim b$

$\equiv T$

 

Hence, Option(B) $(a \rightarrow c)\rightarrow (\sim b \rightarrow(a \wedge c))$ is the correct choice.
4 4 votes
here, option a,c,d are only give T value by evaluating each parts... And option b does not give any Truth value. hence, b is the answer.
1 1 vote
we can also solve it by satisfying the T(try to make LHS true) and F(try to make RHS False) condition of ->(implication), if it satisfied then it is NOT tautology. if it is not then it is Tautology. Answer is B
1 1 vote

😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊

Answer:
Position:
Show:

Related questions

84 84 votes
16 answers 16 answers
24.4k
24.4k views
go_editor asked Sep 28, 2014
24,408 views
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?$(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge...
121 121 votes
9 answers 9 answers
47.8k
47.8k views
go_editor asked Sep 28, 2014
47,848 views
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied ...
123 123 votes
8 8 answers
30.6k
30.6k views
go_editor asked Sep 28, 2014
30,642 views
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives t...
66 66 votes
3 answers 3 answers
21.1k
21.1k views
go_editor asked Sep 28, 2014
21,090 views
The number of distinct minimum spanning trees for the weighted graph below is _____