Unhelpful Trees

Today I wondered about the connection between

Under certain ideal conditions, something is conceivable iff it is possible

and

Something is possible iff it is conceivable under certain ideal conditions.

So I asked my tree prover whether

1)  for all y(Iy then  for all x(Px iff Cxy)) then  for all x(Px iff  for all y(Iy then Cxy))
and
2)  for all x(Px iff  for all y(Iy then Cxy)) then  for all y(Iy then  for all x(Px iff Cxy)).
The answer to the first question is "not valid (1764 nodes, 84 open branches)". For the second question I manually stopped the prover at "79623 nodes, 727 unticked, 35844 open branches, 18 constants". Clearly, these results are not very helpful.

Returning to pen and paper, I found out that (1) is false iff nothing is I. (Hence ( for all y(Iy then  for all x(Px iff Cxy)) and  exists yIy) then  for all x(Px iff  for all y(Iy then Cxy)) is valid -- though my tree prover runs into a problem when painting the 491 node tree, at least on Mozilla-1.5/Linux/PPC. Need to investigate further.) And (2) has a counter-model with 3 individuals: Ia, -Pb, Cba, Ic, -Cbc. I'll have to teach my prover to tell me that.

Comments

No comments yet.

Add a comment

Please leave these fields blank (spam trap):

No HTML please.
You can edit this comment until 30 minutes after posting.