can anyone solve the following Symbolic Logic Philosophy problems?
Mei-Chuan Tseng
Hello! Guys,
I have the difficulties for the following question which is in Symbolic
Logic Philosophy. Any one can help? Thank you lah!! :)
Oh!! Remember there is one symbolic like the reverse side of "E"?
Since I can't type it, I only type "E" to represent. :)
And there another one is a "/" on "0" ? Since I can't type it as well, I
will type "P" to represent. And "<->" is for two way arrow, of course
"->" will be one way arrow. And in mathematics we call something like
"Alfa", I will use "a" to represent it as well.
Thank you guys!! :)
# Find an interpretation I such that one of the sentences
(x)(Ey)(Fx <-> Gy)
and (Ey)(x)(Fx <-> Gy)
is true and the other is false. State which is which.
D(domain)=
f('F')=
f('G')=
#Find a formula P such that the sentence (Ea)P (for some variable a) is
valid, and such tha t(a)P is not valid.
P=
# Find interpretations to show that the following sets of sentences are
consistent:
i){'-(x)Rxx' , '(x)(y)(Rxy ->Ryx)' , '(x)(y)(z)((Rxy&Ryz) ->Rxz)'}
D=
f('R'=
ii){'(x)Rxx' , '-(x)(y)(Rxy ->Ryx)' '(x)(y)(z)((Rxy&Ryz) ->Rxz)'}
D=
f('R')=
iii){'(x)Rxx' , '(x)(y)(Rxy ->Ryx)' , '-(x)(y)(z)((Rxy&Ryz) ->Rxz)'}
D=
f('R')=
m.michae...@gmail.com
communicating only inside of statements as some but not all implicit questions