diff --git a/doc/intrusive.qbk b/doc/intrusive.qbk
index 4f37f12..aca3694 100644
--- a/doc/intrusive.qbk
+++ b/doc/intrusive.qbk
@@ -871,7 +871,7 @@ the section [link intrusive.usage How to use Boost.Intrusive]:
 *  [*`linear<bool Enable>`]: the singly linked list is implemented as a
    null-terminated list instead of a circular list. This allows `O(1)` swap,
    but losses some operations like `container_from_end_iterator`.
-*  [*`cache_last<bool Enable>`]: the singly linked also stores a pointer to the
+*  [*`cache_last<bool Enable>`]: `slist` also stores a pointer to the
    last element of the singly linked list. This allows `O(1)` swap,
    `splice_after(iterator, slist &)` and makes the list offer new functions
    like `push_back(reference)` and `back()`. Logically, the size an empty list is
diff --git a/include/boost/intrusive/options.hpp b/include/boost/intrusive/options.hpp
index cbbd123..f6854e4 100644
--- a/include/boost/intrusive/options.hpp
+++ b/include/boost/intrusive/options.hpp
@@ -316,12 +316,13 @@ BOOST_INTRUSIVE_OPTION_CONSTANT(link_mode, link_mode_type, LinkType, link_mode)
 //!should be optimized for size instead of for speed.
 BOOST_INTRUSIVE_OPTION_CONSTANT(optimize_size, bool, Enabled, optimize_size)
 
-//!This option setter specifies if the list container should
+//!This option setter specifies if the slist container should
 //!use a linear implementation instead of a circular one.
 BOOST_INTRUSIVE_OPTION_CONSTANT(linear, bool, Enabled, linear)
 
-//!This option setter specifies if the list container should
-//!use a linear implementation instead of a circular one.
+//!If true, slist also stores a pointer to the last element of the singly linked list.
+//!This allows O(1) swap and splice_after(iterator, slist &) for circular slists and makes
+//!possible new functions like push_back(reference) and back().
 BOOST_INTRUSIVE_OPTION_CONSTANT(cache_last, bool, Enabled, cache_last)
 
 //!This option setter specifies the bucket traits