in Mathematical Logic
691 views
2 votes
2 votes
~ $\forall$ x [  P(x) -> (Q(x) v P(x) )  ]
in Mathematical Logic
by
691 views

4 Comments

@Anu sir,

it is, $\exists x(0)$

now predicate is exactly 0(always), which does not depend on value of 'x'
2
2
@anu sir there is no x to check its value.
2
2
oh sory ashwin and nitish my bad. got it

Vs here o is constant. whaterver be x it is not change.
4
4

1 Answer

1 vote
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.

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