lemma calculation of ends, no proof yet

[topbloke-formulae.git] / article.tex

diff --git a/article.tex b/article.tex
index 642190f9f823431a058f3aa1b5793bc3f1751396..07058aa87174419ef9bb1ac115cf8e0f9ac03c90 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -219,6 +219,17 @@ in which case we repeat for $A'$.  Since there are finitely many
 commits, this terminates with $A'' \in \pends()$, ie $A'' \le M$
 by the LHS.  And $A \le A''$.
 }
+\[ \eqn{Calculation Of Ends:}{
+  \bigforall_{C \hasparents \set A}
+    \pendsof{C}{\set P} =
+       \Bigl\{ E \Big|
+           \Bigl[ \Largeexists_{A \in \set A} 
+                       E \in \pendsof{A}{\set P} \Bigr] \land
+           \Bigl[ \Largenexists_{B \in \set A} 
+                       E \neq B \land E \le B \Bigr]
+       \Bigr\}
+}\]
+XXX proof TBD.
 
 \section{Commit annotation}