cap.tex

   1 % CAP theorem (Gilbert and Lynch's formulation of Brewer's Conjecture)
   2 %
   3 % CC0 1.0.
   4 % http://creativecommons.org/publicdomain/zero/1.0
   5
   6 \input{preamble}
   7
   8 \begin{document}
   9
  10 \vspace*{2.6em}
  11 \begin{center}
  12 {\initcapfont{72}{76}I}%
  13 {\gilgalfont{37}{40}t is impossible \\
  14 in the asynchronous network model \\
  15 to implement a read/write data object \\
  16 that guarantees the following properties:\par}
  17 \end{center}
  18 \vspace*{0.2em}
  19 {\gilgalfont{37}{40}
  20 \hspace*{4.5em}{\gilgalfont{120}{40}\raisebox{9.5pt}{.}}\,Availability \\
  21 \hspace*{4.5em}{\gilgalfont{120}{40}\raisebox{9.5pt}{.}}\,Atomic consistency
  22 \vspace*{0.2em}
  23 \begin{center}
  24 {\gilgalfont{37}{40}in all fair executions \\ \par}
  25 {\gilgalfont{28}{40}(including those in which messages are lost).\par}
  26 \end{center}
  27
  28 \end{document}