\begin{center}
\LARGE
Some improvements of a lemma of Rosenfeld

\end{center}

\begin{center}
\Large
Fran\c{c}ois Boulier
\end{center}

\noindent
Date:  July 17th (Wednesday)\\
Time:  09:20-09:50\\

\begin{center}
\large
Abstract
\end{center}

We give some improvements of a lemma of Rosenfeld which permit us to
optimize some algorithms in differential algebra: we prove the
lemma with weaker hypotheses and we demonstrate an analogue
of Buchberger's second criterion, which avoids non necessary
reductions for detecting coherent sets of differential polynomials.
We try also to clarify the relations between the theorems in
differential algebra and some more widely known results in the
Gr\"obner bases theory.


