Question: ( c ) ( 1 5 points ) Suppose that , , are well - formed formulas generated by some propositions. Now, we know something

(c)(15 points) Suppose that ,, are well-formed formulas generated by some propositions. Now, we know something about the world that {??}||== holds. Meaning that we don't know exactly about which wffs (,,) are true in our world nor any truth-value assignments about the propositions (model). However, we know that the entailment must hold, {??}||==.
In this case, show that {}||==() holds. This may seem hard: but basically, what we're trying to do is show that the first entailment rules out some possible worlds where the entailment doesn't hold. Once we've ruled out those worlds, we can show that the second entailment holds in the worlds that are left. To do this, use a few steps (show all of these):
 (c)(15 points) Suppose that ,, are well-formed formulas generated by some

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!