chiark
/
gitweb
/
~ian
/
topbloke-formulae.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
e9a717c
)
merge fixes/clarifications - add missing \
author
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Fri, 16 Mar 2012 21:59:10 +0000
(21:59 +0000)
committer
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Fri, 16 Mar 2012 21:59:10 +0000
(21:59 +0000)
merge.tex
patch
|
blob
|
history
diff --git
a/merge.tex
b/merge.tex
index e295d3f4d2dbfb721b240c90ca12960c6eadcf45..a8dd9a7c6061530a7ebdb46b3975de9ff74fd7e3 100644
(file)
--- a/
merge.tex
+++ b/
merge.tex
@@
-81,7
+81,7
@@
and calculate $\pendsof{C}{\pn}$. So we will consider some
putative ancestor $A \in \pn$ and see whether $A \le C$.
By Exact Ancestors for C, $A \le C \equiv A \le L \lor A \le R \lor A = C$.
-But $C \in py$ and $A \in \pn$ so $A \neq C$.
+But $C \in
\
py$ and $A \in \pn$ so $A \neq C$.
Thus $A \le C \equiv A \le L \lor A \le R$.
By Unique Base of L and Transitive Ancestors,