The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

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

  1. $Q(x) → P (x) \vee \sim R (a)$
  2. $R (a) \wedge \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.

asked in Mathematical Logic by Veteran (59.5k points)
retagged by | 347 views

1 Answer

0 votes

Answered it using rules of inference, please see below image:

After applying appropriate rules of inference, at last we get ~Q(a), which is inconsistent (as it will give True if Q(a) is false and vice versa. Therefore, always true/always false is not possible).

answered by Active (1.4k points)

why can't we further resolve Q(a) (obtained by resolution) with Q(a) (given in question)?

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,481 questions
46,655 answers
57,353 users