Changed to bold. Closes #668 again

Author: JJ

doc/Language/setbagmix.pod6

@@ -12,23 +12,23 @@ L<MixHash|/type/MixHash>. Being unordered, these containers can be more
 efficient than L<Lists|/type/List> for looking up elements or dealing with
 repeated items.
 
-If you want to get the contained objects (elements) I<without duplicates>
+If you want to get the contained objects (elements) B<without duplicates>
 and you only care I<whether> an element is in the collection or not,
-you can use a L<Set|/type/Set> or L<SetHash|/type/SetHash>. (If you want
+you can use a L<Set|/type/Set> or L<SetHash|/type/SetHash>. If you want
 to get rid of duplicates but still preserve order, take a look at the
-L<unique|/routine/unique> routine for L<List|/type/List>.)
+L<unique|/routine/unique> routine for L<List|/type/List>.
 
 =begin comment
 =defn  Set or SetHash
 Collection of distinct objects
 =end comment
 
-If you want to keep track of the I<number of times each object appeared>,
+If you want to keep track of the B<number of times each object appeared>,
 you can use a L<Bag|/type/Bag> or L<BagHash|/type/BagHash>. In these
 Baggy containers each element has a weight (an unsigned integer)
 indicating the number of times the same object has been included in the
 collection. The types L<Mix|/type/Mix> and L<MixHash|/type/MixHash> are
-similar, but they also allow I<fractional weights>.
+similar, but they also allow B<fractional weights>.
 
 =begin comment
 =defn  Bag or BagHash