Online Computer Dictionary

1. A finite sequence of well-formed formulas, 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.

2. A left-associative natural language parser by Craig R. Latta . Ported to Decstation 3100, Sun-4.

ftp://scam.berkeley.edu/pub/src/local/proof/.

E-mail: . Mailing list: proof-requestf@xcf.berkeley.edu (Subject: add me).