+1 vote
260 views

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.

retagged | 260 views

1
2