[Aptitude-svn-commit] r3801 - in branches/aptitude-0.3/aptitude: . src/generic/problemresolver

[Daniel Burrows]

Author: dburrows
Date: Thu Aug 11 00:56:58 2005
New Revision: 3801

Modified:
   branches/aptitude-0.3/aptitude/ChangeLog
   branches/aptitude-0.3/aptitude/src/generic/problemresolver/model.tex
Log:
Fix LaTeX errors.

Modified: branches/aptitude-0.3/aptitude/ChangeLog
==============================================================================
--- branches/aptitude-0.3/aptitude/ChangeLog	(original)
+++ branches/aptitude-0.3/aptitude/ChangeLog	Thu Aug 11 00:56:58 2005
@@ -2,6 +2,10 @@
 
 	* src/generic/problemresolver/model.tex:
 
+	  Fix LaTeX errors.
+
+	* src/generic/problemresolver/model.tex:
+
 	  Finish the correctness proof of the algorithm, start blathering
 	  about efficiency.
 

Modified: branches/aptitude-0.3/aptitude/src/generic/problemresolver/model.tex
==============================================================================
--- branches/aptitude-0.3/aptitude/src/generic/problemresolver/model.tex	(original)
+++ branches/aptitude-0.3/aptitude/src/generic/problemresolver/model.tex	Thu Aug 11 00:56:58 2005
@@ -1113,12 +1113,12 @@
   Let $I' = I_0;R_1';v_j;R_2';R_3'$.
 
   If $I'$ is consistent -- i.e., $Broken(I')=\emptyset$, let $R' =
-  R_1',\act{v_j}{d_i},\call{ResolveFrom}{I_0;R_1';v_j,R_2' \cup
+  R_1',\act{v_j}{d_i},\Call{ResolveFrom}{I_0;R_1';v_j,R_2' \cup
     R_3'}$. By Lemma~\ref{lem:resolve-from-correct},
   $\Call{ResolveFrom}{I_0;R_1';v_j,R_2' \cup R_3'}$ is a resolution
   sequence for $I_0;R_1';v_j$ such that $Broken(I_0;R')=\emptyset$.
   In addition, since each element of
-  $\call{ResolveFrom}{I_0;R_1';v_j,R_2' \cup R_3'}$ is a member of
+  $\Call{ResolveFrom}{I_0;R_1';v_j,R_2' \cup R_3'}$ is a member of
   $R_2' \cup R_3'$, the maximum length of $R'$ is
   $\len{R_1'}+\len{\{v_j\}}+\len{R_2'}+\len{R_3'}=\len{R}-1$.  Thus,
   by the inductive hypothesis, $\Call{EliminateStupid}{I_0,R'}$ is a