previous up next
Go backward to Typical Use
Go up to Top
Go forward to Example
RISC-Linz logo

Universal Quantification in Knowledge

Proposition: For proving with knowledge K union {forall x: F} the goal G, it suffices to prove G with additional knowledge F[x <- T] for any term T:

K union {forall x: F}
K union {forall x: F, F[x <- T]}

"We have to prove G. Since we know (forall x: F), we have F[x <- T] and thus ...(proof of G with additional knowledge F[x <- T])."

A formula (forall x: F) in the knowledge is a machine that takes any T and produces additional knowledge F[x <- T].

Author: Wolfgang Schreiner
Last Modification: November 30, 1999

previous up next