658 views
0 votes
0 votes

1 Answer

0 votes
0 votes
(a)

$\forall x \left ( W\vee A\left ( x \right ) \right )\Leftrightarrow W\vee \forall x A\left ( x \right )$

$\Rightarrow$W=true $\Rightarrow \forall x \left ( True \right )\Leftrightarrow \forall x \left ( True \right )\Rightarrow Make Sense$

$\Rightarrow$W=false $\Rightarrow$$\forall x A\left ( x \right ) \Leftrightarrow \forall x A\left ( x \right )$(Hence a is valid)
(As the truth value totally dependent on $A\left ( x \right )$)
(b)

$\exists x \left ( A\left ( x \right )\rightarrow W \right )\Leftrightarrow \forall x A\left ( x \right )\rightarrow W$

if W= true$\Rightarrow \exists x\left ( true \right )\Leftrightarrow \forall x\left ( true \right )\Rightarrow$ make sense as it is saying there exists some element 'x' which is true if and only if there are all x which is 'true'
(as conclusion is true then whole statement is true)
if W=false $\Rightarrow$$\exists x{ \left( A\left ( x \right ) \right )}'\Leftrightarrow \forall x A{\left ( x \right )}'\Rightarrow$It  is trivially valid as it says There exists some x which is not A(x) if and only if there are all x which is not A(x)

(As the truth value totally dependent on ${A\left ( x \right )}'$)

c)

$\forall x \left ( A\left ( x \right )\rightarrow W \right )\Leftrightarrow \forall x A\left ( x \right )\rightarrow W$

if  W=true ,same as case b)

if W=false $\forall x {A\left ( x \right )}'\Leftrightarrow \forall x {A\left ( x \right )}'\Rightarrow TRUE$

d)$\forall x \left ( A\left ( x \right )\rightarrow W \right )\Leftrightarrow \exists x A\left ( x \right )\rightarrow W$

if W=True,same as case b) and c)

if w=False$\Rightarrow \forall x{ \left ( A\left ( x \right ) \right )}'\Leftrightarrow \exists x { \left ( A\left ( x \right ) \right )}'$

this does not makes sense as it says that for all x which is not A(x) if and only there exists some number which is not A(x).

Hence D) is answer.
edited by

Related questions

674
views
2 answers
0 votes
yuuchan asked Jul 22, 2023
674 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
336
views
0 answers
0 votes
486
views
1 answers
1 votes
atulcse asked Oct 31, 2021
486 views
An outer join can be done between:a. only two tables b. only three tables c. any number of tables
259
views
0 answers
0 votes
chandan2teja asked May 26, 2019
259 views
If X is minimum element of S then X is related to y for all y belongs to S. Let [S;R] be a poset. If every non empty subset of S has a minimum ... of S. Is this correct way of interpreting the question. If not can you please elaborate it