Wed, 21 Aug 1996 11:00:04 +0200 Added le_eq_less_Suc; fixed some comments;
paulson [Wed, 21 Aug 1996 11:00:04 +0200] rev 1931
Added le_eq_less_Suc; fixed some comments; a bit of tidying up
Tue, 20 Aug 1996 18:53:17 +0200 Working version of NS, messages 1-4!
paulson [Tue, 20 Aug 1996 18:53:17 +0200] rev 1930
Working version of NS, messages 1-4!
Tue, 20 Aug 1996 17:46:24 +0200 Working version of NS, messages 1-3, WITH INTERLEAVING
paulson [Tue, 20 Aug 1996 17:46:24 +0200] rev 1929
Working version of NS, messages 1-3, WITH INTERLEAVING
Tue, 20 Aug 1996 12:40:17 +0200 Added ref to allow suppression of error msgs
paulson [Tue, 20 Aug 1996 12:40:17 +0200] rev 1928
Added ref to allow suppression of error msgs
Tue, 20 Aug 1996 12:39:30 +0200 New classical reasoner: warns of, and ignores, redundant rules.
paulson [Tue, 20 Aug 1996 12:39:30 +0200] rev 1927
New classical reasoner: warns of, and ignores, redundant rules. Also warns of rules supplied with different "hints" (Safe, etc.)
Tue, 20 Aug 1996 12:36:58 +0200 Addition of function set_of_list
paulson [Tue, 20 Aug 1996 12:36:58 +0200] rev 1926
Addition of function set_of_list
Tue, 20 Aug 1996 12:32:16 +0200 Some tidying. This brittle proof depends upon
paulson [Tue, 20 Aug 1996 12:32:16 +0200] rev 1925
Some tidying. This brittle proof depends upon AddSEs [less_SucE];
(0) -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip