1. <logic> A finite, non-empty sequence of wffs 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. In short, a derivation in which all premises are theorems.
See constructive proof, derivation, existence proof proof theory
[Glossary of First-Order Logic] and [FOLDOC]
2. A left-associative natural language parser by Craig R. Latta <email@example.com>. Ported to Decstation 3100, Sun-4.
Recommended Reading: Proof, Logic and Formalization, ed. by Michael Detlefsen (Routledge, 1992); Donald C. Benson, The Moment of Proof: Mathematical Epiphanies (Oxford, 2000); Lance J. Rips, The Psychology of Proof: Deductive Reasoning in Human Thinking (Bradford, 1994); and Handbook of Proof Theory, ed. by Samuel R. Buss (Elsevier, 1998).
based on [FOLDOC], [A Dictionary of Philosophical Terms and Names]
Try this search on OneLook / Google