\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Aaron N. Siegel}
%
%
\medskip
\noindent
%
%
{\bf Reduced Canonical Forms of Stoppers}
%
%
\vskip 5mm
\noindent
%
%
%
%
The \emph{reduced canonical form} of a loopfree game $G$ is the
simplest game infinitesimally close to $G$. Reduced canonical forms
were introduced by Calistrate, and Grossman and Siegel provided an
alternate proof of their existence. In this paper, we show that the
Grossman--Siegel construction generalizes to find reduced canonical
forms of certain loopy games.
\bye