josia-notes/w23-logic-3
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fixed some typesetting problems
Some checks failed
Build latex and deploy / checkout (push) Failing after 18m52s
Details

Browse source
This commit is contained in:
Josia Pietsch 2024-02-09 20:43:19 +01:00
parent 458dd9ab1f
commit 6c5eda59e4
Signed by: josia
GPG key ID: E70B571D66986A2D
1 changed files with 4 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
inputs/lecture_26.tex
View file

@ -83,13 +83,10 @@ We do a second proof of \yaref{thm:hindman}:
\footnote{Note that here we might need to choose \footnote{Note that here we might need to choose
a bigger $N$ than the $M$ in \yaref{def:unifrec}, a bigger $N$ than the $M$ in \yaref{def:unifrec},
but $2M$ suffices.}% but $2M$ suffices.}%
\[ \begin{IEEEeqnarray*}{rl}
\forall n.~\exists N% \gg n \forall n.~\exists N.~\forall r.~&(y(r), y(r+1), \ldots, y(r+N - 1)\\
.~\forall r.~(y(r), y(r+1), \ldots, y(r+N - 1) &\text{ contains } (y(0), y(1), \ldots, y(n)) \text{ as a subsequence.}\\
\text{ contains } \end{IEEEeqnarray*}
(y(0), y(1), \ldots, y(n))
\text{ as a subsequence.}
\]
\end{itemize} \end{itemize}
Consider $y(0)$. Consider $y(0)$.