Go backward to Example Go up to Top Go forward to Decomposition of Existential Quantifications |
Instead of proving (forall x: G) we assume (~forall x: G), i.e., (exists x: ~G) and proceed to derive a contradiction:
~~>
K forall x: G ( ~~>
K union {exists x: ~G} F(alse) )
K union {~G[x <- a]} F(alse)
"We prove (forall x: G). Assume ~G for some x. Then ... (derivation of a contradiction with additional knowledge ~G)."
We will see later how to work with existential formulas in knowledge.