[conv.qual, temp.deduct.conv] Improve presentation of conversion sequences

Author: tkoeppe

source/conversions.tex

@@ -243,11 +243,9 @@
 is a sequence of
 $cv_i$ and $P_i$
 such that \tcode{T} is
-
 \begin{indented}
-``$cv_0$ $P_0$ $cv_1$ $P_1$ $\cdots$ $cv_{n-1}$ $P_{n-1}$ $cv_n$ \tcode{U}'' for \placeholder{n} $> 0$,
+``$cv_0$ $P_0$ $cv_1$ $P_1$ $\cdots$ $cv_{n-1}$ $P_{n-1}$ $cv_n$ \tcode{U}'' for $n > 0$,
 \end{indented}
-
 where
 each $cv_i$ is a set of cv-qualifiers~(\ref{basic.type.qualifier}), and
 each $P_i$ is
@@ -263,15 +261,15 @@
 has two cv-decompositions,
 taking \tcode{U} as ``\tcode{int}'' and as ``pointer to \tcode{const int}''.
 \end{example}
-The \placeholder{n}-tuple of cv-qualifiers after the first one
+The $n$-tuple of cv-qualifiers after the first one
 in the longest cv-decomposition of \tcode{T}, that is,
-$cv_1$, $cv_2$, $\cdots$, $cv_n$, is called the
+$cv_1, cv_2, \dotsc, cv_n$, is called the
 \defn{cv-qualification signature} of \tcode{T}.
 
 \pnum
 \indextext{type!similar|see{similar types}}%
 Two types \tcode{T1} and \tcode{T2} are \defnx{similar}{similar types} if
-they have cv-decompositions with the same \placeholder{n}
+they have cv-decompositions with the same $n$
 such that corresponding $P_i$ components are the same
 and the types denoted by \tcode{U} are the same.
 

source/templates.tex

@@ -6532,16 +6532,16 @@
 is a type
 \begin{indented}
 $\mathit{cv}_{1,0}$ ``pointer to $\ldots$'' $\mathit{cv}_{1,n-1}$ ``pointer to''
-$\mathit{cv}_{1,n}\mathit{T1}$
+$\mathit{cv}_{1,n}$ \tcode{T1}
 \end{indented}
 and
 \tcode{P}
 is a type
 \begin{indented}
 $\mathit{cv}_{2,0}$ ``pointer to $\ldots$'' $\mathit{cv}_{2,n-1}$ ``pointer to''
-$\mathit{cv}_{2,n}\mathit{T2}$
+$\mathit{cv}_{2,n}$ \tcode{T2},
 \end{indented}
-The cv-unqualified
+then the cv-unqualified
 \tcode{T1}
 and
 \tcode{T2}