Return-Path: <john.harrison-request@uk.ac.cam.cl>
Delivery-Date: 
Received: from ted.cs.uidaho.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.4) outside ac.uk; Thu, 25 Feb 1993 05:21:23 +0000
Received: by ted.cs.uidaho.edu (16.6/1.34) id AA20335;
          Wed, 24 Feb 93 20:45:09 -0800
Sender: info-hol-request@edu.uidaho.cs.ted
Errors-To: info-hol-request@edu.uidaho.cs.ted
Precedence: bulk
Received: from Moby.CS.UCLA.EDU by ted.cs.uidaho.edu (16.6/1.34) id AA20330;
          Wed, 24 Feb 93 20:44:45 -0800
Received: by makaha.cs.ucla.edu (Sendmail 5.61a+YP/2.27) id AA04219;
          Wed, 24 Feb 93 20:44:09 -0800
Date: Wed, 24 Feb 93 20:44:09 -0800
From: toal@edu.ucla.cs (Ray J. Toal)
Message-Id: <9302250444.AA04219@makaha.cs.ucla.edu>
To: info-hol@edu.uidaho.cs.ted
Subject: Arithmetic
Cc: toal@edu.ucla.cs


Hi,

Where does one look for nice, powerful aritmetic simplification tools
to help you derive from

   |- k =  k1 + ((k1' + (1 + 1)) + 1)

the theorems

   |- k1 < k  and  |- k1' < k

or, more generally, a list of theorems for all ki's on the rhs of
such an equation, where there is at least one non-zero addend?
In arithmetic, more-arithmetic, a library, or a contrib?
Thanks for any pointers.

Ray Toal

P.S. I have managed to use HOL for 3 yrs without any need for arithmetic
until now!