\begin{itemize}
\item
$\alpha = \delta \cdot a_n \cdot \varepsilon$
\item
$\gamma$ is the sequence returned by $wt(s_{n-1},Q_i)$ and $b$ is
its final state
\item
$a_n$ is an action of process $P_i$
\item
none of the sequences $\beta$, $\gamma$, or $\varepsilon$ contains
an action from process $P_i$
\item
$d_1$ decides 1 and $d_0$ decides 0
\end{itemize}

<pre>{latex}
\begin{itemize}
\item
$\alpha = \delta \cdot a_n \cdot \varepsilon$
\item
$\gamma$ is the sequence returned by $wt(s_{n-1},Q_i)$ and $b$ is
its final state
\item
$a_n$ is an action of process $P_i$
\item
none of the sequences $\beta$, $\gamma$, or $\varepsilon$ contains
an action from process $P_i$
\item
$d_1$ decides 1 and $d_0$ decides 0
\end{itemize}
{latex}
</pre>

{latex}
\enlargethispage{36in}    % keeps everything on one page so it is returned by latex macro.


\Large\begin{center} \textbf{Effectively Nonblocking Consensus
Procedures Can Execute Forever -- a Constructive Version of FLP
}\\
\vspace{.25in}
 \large{Robert L. Constable}\\
 \normalsize\em{Cornell University} \\
 \normalsize\em{Print date: \today}\\
 \normalsize\em{July 17, 2008}\footnote{The current draft includes improvements up to August 30,
2008 and small non technical edits to the July 17, 2008 version made in August 2011.  See Acknowledgements at the end of the article for grants supporting this work.}

\end{center}


{latex}