in Mathematical Logic
533 views
2 votes
2 votes
Which of the following is true for the predicate logic P ?

~ $\forall z[P(z) \rightarrow ($~$Q(z)\rightarrow P(z)) ]$

a.) P is satisfiable

b.) P is Tautology

c.) P is Contradiction

d.) None of these
in Mathematical Logic
by
533 views

9 Comments

Contradiction?
0
0
Yes given ans is contradiction but my doubt is if I am propagating the negation inside

it would become

$\exists z[$~$P(z)\rightarrow (Q(z) \rightarrow $~$P(z))]$

so further solving this it comes

$\exists z$ (True)

what is wrong with this approach ?
0
0
∀z [A(z)]  -> For all z, A[z] is true

~ would be ∃z for which A[z] will be false.

I thought in statements. Taking negation in terms of statement would be

for all z A[z] is false.
0
0
if everyone is true its negation would be atleast one is false

like in a village everyone says truth only

so for negating this statement atleast one person saying lie would suffice

 

hope you get it
0
0
edited by

~∀z[P(z)→(~Q(z)→P(z))]

you are solving problem in your ways (by creating new thing). when you propagate negation then why doing partiality with inside expression.

~ ∀z[  some thing]

what you are solving is 

~ ∀z[P(z)]→(~Q(z)→P(z))

Hope you got it.

0
0
sorry, I didn't get you. your expression seems different from what I have posted .
0
0
Now check...
0
0
But I have propagated the negation all the way till end in the expression

I have negated Q an P as well
0
0
The expression in square brackets is true. It's a tautology.

But how to evaluate ~ ∀z [tautology] in logic terms?
0
0

Please log in or register to answer this question.

Related questions

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