Return-Path: <John.Harrison-request@cl.cam.ac.uk>
Delivery-Date: 
Received: from leopard.cs.byu.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) outside ac.uk; Tue, 15 Mar 1994 00:26:31 +0000
Received: by leopard.cs.byu.edu (1.37.109.8/16.2) id AA29499;
          Mon, 14 Mar 1994 17:12:10 -0700
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: bulk
Received: from aero.org by leopard.cs.byu.edu with SMTP (1.37.109.8/16.2) 
          id AA29495; Mon, 14 Mar 1994 17:12:04 -0700
Received: from antares.aero.org by aerospace.aero.org with SMTP (5.65c/6.0.GT) 
          id AA16796 for info-hol@leopard.cs.byu.edu;
          Mon, 14 Mar 1994 16:12:14 -0800
Posted-Date: Mon, 14 Mar 94 16:12:12 PST
Message-Id: <199403150012.AA16796@aerospace.aero.org>
Received: from danube.aero.org by antares.aero.org (4.1/AMS-1.0) id AA05389 
          for info-hol@leopard.cs.byu.edu; Mon, 14 Mar 94 16:12:13 PST
Date: Mon, 14 Mar 94 16:12:12 PST
From: cal@aero.org
To: info-hol@leopard.cs.byu.edu
Subject: formal and rigorous and paper and plastic(&metal 8-))


notes on formal and rigorous -

matthew morley gets it right (at least as mathematicians use it) - formal
means "out of context" - i.e., that nothing except the explicitly allowed
rules can be used (anything that is not explicitly allowed is forbidden) - the
other description of formal, too mean without enumeration, is just wrong

i used to annoy my boss (who developed a proof system for an interesting and
useful version of temporal logic) by saying that "producing proofs by computer
automatically makes them less reliable" - what i meant by that is that there
are some fairly well-understood conventions about what is and is not rigorous
proof in mathematics, so any purported proof can be fairly readily checked -

however, when we start looking at proofs built by computer, there are very
different capabilities for symbol manipulation - so, for example, computer
generated proofs are MUCH harder to read and understand (and i am not talking
at _all_ about the proof of the Four-Color Theorem, which is a whole 'nother
can of worms), because they use different conventions for what they report and
for what level of abstraction they can use - so the correctness of the proof
comes down to the correctness of the program, which is problematical at best
(yes, i know, programs with a sufficiently long track record become trusted -
well, so do mathematicians *smile* and i haven't yet found a prover that i
trust without lots of careful checking of the individual proofs produced)

flames to /dev/null, please

more later,
cal
