X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=weblib%2Ftutorial%2Fchapter5.ma;h=f0c4977077a4bd9f789d2d9cf12a230d2f2edaa6;hb=63ffd77b87eed31ea50ba0260c6e885abe8c552b;hp=014cb611f94cdc7be6eecc41beaa6479f23a2421;hpb=102c93c0642ae14649d501332a075124ae18e5b3;p=helm.git

diff --git a/weblib/tutorial/chapter5.ma b/weblib/tutorial/chapter5.ma
index 014cb611f..f0c497707 100644
--- a/weblib/tutorial/chapter5.ma
+++ b/weblib/tutorial/chapter5.ma
@@ -1,4 +1,6 @@
-(* The fact of being able to decide, via a computable boolean function, the 
+(* 
+h1 class="section"Effective searching/h1
+The fact of being able to decide, via a computable boolean function, the 
 equality between elements of a given set is an essential prerequisite for 
 effectively searching an element of that set inside a data structure. In this 
 section we shall define several boolean functions acting on lists of elements in