diff --git a/Old_Packages/Doc23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex b/Old_Packages/Doc23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
index 42a816c15aa..27bc3a04937 100644
--- a/Old_Packages/Doc23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
+++ b/Old_Packages/Doc23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
@@ -3,7 +3,7 @@ A model for this must provide:
 
 \ccCreationVariable{fo}
 
-\ccMemberFunction{Bounded_side operator()(const Kernel::Point_3&p, 
+\ccMemberFunction{Oriented_side operator()(const Kernel::Point_3&p, 
                                           const Kernel::Point_3&q, 
                                           const Kernel::Point_3&r, 
                                           const Kernel::Point_3&s, 
diff --git a/Old_Packages/Doc23/doc_tex/kernel/kernel_representation.tex b/Old_Packages/Doc23/doc_tex/kernel/kernel_representation.tex
index 83d3532c914..2029fc427e3 100644
--- a/Old_Packages/Doc23/doc_tex/kernel/kernel_representation.tex
+++ b/Old_Packages/Doc23/doc_tex/kernel/kernel_representation.tex
@@ -172,7 +172,7 @@ also makes all \cgal\ classes very uniform. They {\bf always} consist of:
 \end{enumerate}
 
 \section{Kernel as a Traits Class}
-Algorithms and data structures in the basic library of CGAL are parameterized 
+Algorithms and data structures in the basic library of \cgal\ are parameterized 
 by a traits class that subsumes the objects on which the algorithm or data
 structure operates as well as the operations to do so. For most of the 
 algorithms and data structures in the basic library you can use a kernel
diff --git a/Packages/Kernel_23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex b/Packages/Kernel_23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
index 42a816c15aa..27bc3a04937 100644
--- a/Packages/Kernel_23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
+++ b/Packages/Kernel_23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
@@ -3,7 +3,7 @@ A model for this must provide:
 
 \ccCreationVariable{fo}
 
-\ccMemberFunction{Bounded_side operator()(const Kernel::Point_3&p, 
+\ccMemberFunction{Oriented_side operator()(const Kernel::Point_3&p, 
                                           const Kernel::Point_3&q, 
                                           const Kernel::Point_3&r, 
                                           const Kernel::Point_3&s, 
diff --git a/Packages/Kernel_23/doc_tex/kernel/kernel_representation.tex b/Packages/Kernel_23/doc_tex/kernel/kernel_representation.tex
index 83d3532c914..2029fc427e3 100644
--- a/Packages/Kernel_23/doc_tex/kernel/kernel_representation.tex
+++ b/Packages/Kernel_23/doc_tex/kernel/kernel_representation.tex
@@ -172,7 +172,7 @@ also makes all \cgal\ classes very uniform. They {\bf always} consist of:
 \end{enumerate}
 
 \section{Kernel as a Traits Class}
-Algorithms and data structures in the basic library of CGAL are parameterized 
+Algorithms and data structures in the basic library of \cgal\ are parameterized 
 by a traits class that subsumes the objects on which the algorithm or data
 structure operates as well as the operations to do so. For most of the 
 algorithms and data structures in the basic library you can use a kernel