Problem 10E

Suppose that in a three-round obligato game, the teacher first gives the student the proposition p →q. then the proposition ¬( p ∨ r) ∨ q, and finally the proposition q. For which of the eight possible sequences of three answers will the student pass the test?

Solution

In this question it is given that in a three round obligato game, the teacher first gives the student the preposition , then the proposition -(p,v,r) v q and finally the proposition q. We have to find out for which of the eight possible sequences of three answers will the student pass the test .

Step 1

Let T represents acceptance and F represents rejection

So the possible solutions given by a student can be

It is also given that

1.When a student accepts an assertion it is accepted as commitment.

2.When a student rejects an assertion its negation is added as commitment.

3.And if the student has maintained consistency in all his commitments he passes the test.

This implies that the commitment is T in all of the cases.

Therefore a student will pass the test for all of the eight possible sequences of three answers.