1,620 views
2 2 votes
~ $\forall$ x [  P(x) -> (Q(x) v P(x) )  ]

1 Answer

1 1 vote

$\sim ∀ x$ $[P(x) \rightarrow (Q(x) \vee P(x))]$

this can also be written as

$\sim$ ∀x$[(P(x) \rightarrow (Q(x) )\vee (P(x)\rightarrow P(x) )]$

$P(x)\rightarrow P(x)$ will alwaysb be true,

$\sim$ ∀x$[(P(x) \rightarrow (Q(x) )\vee True]$ 

$\sim$ ∀x[True]

"This is not the case that for all "x" the expression is True"

We know that, $\sim$∀$x P(x)$ $\equiv ∃x \sim P(x)$

$∃x \sim[True]$

$∃x [False]$

Value of predicate which is false does not depends on what is the value of x. Hence the expression is a Contradiction.

Position:
Show:

Related questions

5 5 votes
1 answers 1 answer
4.2k
4.2k views
hitendra singh asked Oct 22, 2018
4,234 views
State T/F:1- Every satisfiable is a contingency2- Every satisfiable is a Tautology.
1 1 vote
2 answers 2 answers
2.5k
2.5k views
1 1 vote
1 answers 1 answer
4.1k
4.1k views
Shubhanshu asked Jul 20, 2017
4,074 views
I am try to develop a venn diagram relation between:-Tautology/ Contradiction/ Contingency/ SatisfiabilityBut where I can fit the Contingency in below diagram?I think it ...
0 0 votes
0 0 answers
767
767 views
mohit kumar 5 asked Dec 16, 2017
767 views
(∀x∀yP(x,y))→(∀x∀yP(y,x)) is tautology or not??