1. < logic > A finite sequence of well-formed formula s, F1, F2, ... Fn, where each Fi either is an axiom , or follows by some rule of inference from some of the previous F's, and Fn is the statement being proved.
See also proof theory .
2. A left-associative natural language parser by Craig R. Latta latta@xcf.berkeley.edu . Ported to Decstation 3100 , Sun-4 .
ftp://scam.berkeley.edu/pub/src/local/proof/ .
E-mail: proof@xcf.berkeley.edu . Mailing list: proof-requestf@xcf.berkeley.edu (Subject: add me).
(1994-11-29)