Wed, 21 Jun 2000 10:30:36 +0200 tidied; weakened the (impossible) premises of setsum_UN_disjoint
paulson [Wed, 21 Jun 2000 10:30:36 +0200] rev 9096
tidied; weakened the (impossible) premises of setsum_UN_disjoint
Tue, 20 Jun 2000 11:54:22 +0200 new module for heaps
paulson [Tue, 20 Jun 2000 11:54:22 +0200] rev 9095
new module for heaps
Tue, 20 Jun 2000 11:54:07 +0200 now uses the heap data structure for BEST_FIRST
paulson [Tue, 20 Jun 2000 11:54:07 +0200] rev 9094
now uses the heap data structure for BEST_FIRST
Tue, 20 Jun 2000 11:53:35 +0200 new file heap.ML
paulson [Tue, 20 Jun 2000 11:53:35 +0200] rev 9093
new file heap.ML
Tue, 20 Jun 2000 11:53:16 +0200 changed the Schubert Steamroller proof
paulson [Tue, 20 Jun 2000 11:53:16 +0200] rev 9092
changed the Schubert Steamroller proof
Tue, 20 Jun 2000 11:52:38 +0200 another brick in the wall
paulson [Tue, 20 Jun 2000 11:52:38 +0200] rev 9091
another brick in the wall
Tue, 20 Jun 2000 11:51:21 +0200 changed a step for the improved rules for setsum
paulson [Tue, 20 Jun 2000 11:51:21 +0200] rev 9090
changed a step for the improved rules for setsum
Tue, 20 Jun 2000 11:50:33 +0200 deleted a step made redundant by the improved rules for setsum
paulson [Tue, 20 Jun 2000 11:50:33 +0200] rev 9089
deleted a step made redundant by the improved rules for setsum
Tue, 20 Jun 2000 11:42:24 +0200 replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson [Tue, 20 Jun 2000 11:42:24 +0200] rev 9088
replaced the useless [p]subset_insertD by [p]subset_insert_iff
Tue, 20 Jun 2000 11:41:25 +0200 now setsum f A = 0 unless A is finite
paulson [Tue, 20 Jun 2000 11:41:25 +0200] rev 9087
now setsum f A = 0 unless A is finite
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip