edited by
3,282 views
13 votes
13 votes

Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent:

  1. $Q(x) \rightarrow P (x) \vee \sim R (a)$
  2. $R (a) \vee \sim Q(a)$
  3. $Q(a)$
  4. $\sim P (y)$

where $x$ and $y$ are universally quantified variables, $a$ is a constant and $P, Q, R$ are monadic predicates.

edited by

1 Answer

Best answer
11 votes
11 votes

$\because$ $x$ and $y$ are universally quantified variable, we can write the given arguments as follows :-

  1. $\forall x(Q(x)\rightarrow (P(x)\ V \sim R(a)))$
  2. $(R(a)\ \vee \sim Q(a))$
  3. $Q(a)$
  4. $\forall y (\sim P(y))$

Now using Universal instantiation, $1.$ becomes

  1. $ Q(a)\rightarrow (P(a)\ V \sim R(a))$ where $a$ is an arbitrary constant given in question.

Similarly 4. becomes

  1. $ \sim P(a)$

Using Modus Ponens 5. and 3.

               $Q(a)\rightarrow (P(a)\ V \sim R(a))$

               $\underline {Q(a)\  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \ \ \ \ \ \ \  \ \ \ \ \ \  \ \ \ \ \ \ }$                                           

  1. $\therefore\ P(a)\ V \sim R(a)$

Using resolution 7. and 2.

             $R(a)\ V \sim Q(a))$

             $\underline { \sim R(a)\ V  P(a))\  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \ \ \ \ \ \ \   }$

  1. $\therefore\ P(a)\ V \sim Q(a)$

Using 6. and 8.

           $ P(a)\ V \sim Q(a)$

           $\underline{\sim P(a) \  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \ \ \ \ \ \ \  }$

           $\therefore\  \sim Q(a)$

After applying appropriate rules of inference, at last we get $\sim Q(a)$, which is inconsistent with $(3)$ which requires $Q(a).$

edited by

Related questions

24 votes
24 votes
4 answers
1
Kathleen asked Sep 13, 2014
9,912 views
Which of the following is/are a tautology?$a \vee b \to b \wedge c$$a \wedge b \to b \vee c$$a \vee b \to \left(b \to c \right)$$a \to b \to \left(b \to c \right)$
7 votes
7 votes
2 answers
3
go_editor asked Apr 24, 2016
3,282 views
Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...
10 votes
10 votes
2 answers
4
Kathleen asked Sep 13, 2014
3,472 views
Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9