max2201111

lane44

Aug 13th, 2026
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Latex 10.67 KB | Science | 0 0
  1. \def\extrasenglish{} % for varioref bug https://github.com/latex3/latex2e/issues/2112
  2.  
  3. % 1. Ošetření načítání fontspec
  4. \PassOptionsToPackage{no-math}{fontspec}
  5.  
  6. % 2. BLOKÁDA KAOFONTS: Přinutíme LaTeX si myslet, že kaofonts.sty už byl načten.
  7. % Tím se zcela vyhnes hledání chybějícího fontu "Libertinus Serif".
  8. \makeatletter
  9. \expandafter\def\csname [email protected]\endcsname{}
  10. \makeatother
  11.  
  12. \documentclass[
  13.    a4paper,
  14.    fontsize=10pt,
  15.    twoside=true,
  16.    nofonts,
  17. ]{kaobook}
  18.  
  19. \usepackage{iftex}
  20. \usepackage{fontspec}
  21.  
  22. % 3. Definuješ vlastní dostupné fonty
  23. \setmainfont{TeX Gyre Termes}
  24. \setsansfont{TeX Gyre Heros}
  25. \setmonofont{TeX Gyre Cursor}
  26.  
  27. % 4. OPRAVA PRO BALÍČEK DIALOGUE (\providelength collision fix)
  28. \let\providelength\undefined
  29. \usepackage{dialogue}
  30.  
  31. % Choose the language
  32. \ifxetexorluatex
  33.     \usepackage{polyglossia}
  34.    \setmainlanguage{english}
  35. \else
  36.    \usepackage[english]{babel}
  37. \fi
  38.  
  39. \usepackage[english=british]{csquotes} % English quotes
  40.  
  41. \usepackage{amsmath,amssymb}
  42. \usepackage{mathrsfs}
  43.  
  44. \usepackage{imakeidx}
  45. \usepackage{enumitem}
  46. \usepackage{etoolbox}
  47.  
  48. \makeindex
  49.  
  50. \begin{document}
  51.  
  52. % Fiktivní položky pro zklidnění BibTeXu a MakeIndexu v editoru:
  53. \nocite{*}
  54. \index{dummy}
  55.  
  56. \medskip
  57. \section{Lane Hemaspaandra}
  58. dear hynek
  59.  
  60. again, thanks, and warmest wishes to you. (I don't know if you already have a Ph.D., but if you don't and you are ever are looking to get one, please do consider University of Rochester, and if you do, please let me know so I can make sure the admissions committee doesn't fail to notice yours amidst the hundreds of applications. My most recent Ph.D. graduate, Piotr Faliszewski, who graduated 1.5 years ago and became an assistant professor in Krakow, Poland, came to UR because he send me some comments on The Complexity Companion, and from the correspondence that grew, he applied here, was accepted, did great research and a great Ph.D. thesis, and we now have a slew of joint papers, and a close ongoing research collaboration.)
  61.  
  62. \medskip
  63. {\flushright lane}
  64. \medskip
  65.  
  66. \section{A short story from the computational complexity exam}
  67. One day, at the exam from computational complexity, our teacher gave us
  68. a task and waited for our completing it.
  69.  
  70. I returned to her an empty paper after about an hour of work.
  71. I claimed that for one of the questions the alleged proof I was supposed to carry out was not valid. After a while she spotted a gap in it:
  72. the negation of satisfiable formula may not be unsatisfiable and told
  73. me that I was right. But, she said, why did you started to solve
  74. the 6th out of 7 questions which was by chance incorrectly assigned ?
  75.  
  76. I replied, there was something immediately strange in this assignment.
  77.  
  78. \medskip
  79. \section{Dana Scott}
  80. In 2008 I have asked the following question to FOM forum:
  81.  
  82. I have a question regarding Axiom of Choice.
  83. What is the strength of the following two theories
  84.  
  85. \begin{enumerate}
  86.  \item \label{eq:pyth1} $\textsf{ZF}+\{\text{on every filter, there is a selector}\}$
  87.  \item \label{eq:pyth2} $\textsf{ZF}+\{\text{on every ultrafilter, there is a selector}\}$
  88. \end{enumerate}
  89.  
  90. Professor Dana Scott comments on the question:
  91.  
  92. \begin{dialogue}
  93. \speak{Dana Scott} How did the question come up?
  94. Why don't you sign your whole name on FOM, so people know who you are?
  95. \speak{Me} I'm interested in $\textsf{ZFC}$ (and other foundational issues), and from time to time have a question on the subject;
  96. but currently have no leadership...
  97. \speak{Dana Scott} Tarski would have liked this question.
  98. \end{dialogue}
  99.  
  100. End of dialogue.
  101.  
  102. \section{A few observations around the time of my graduation}
  103. My Master Thesis Advisor once asked me:
  104.  
  105. \begin{dialogue}
  106. \speak{MTA} Tell me something about semigroups.
  107. \speak{I}
  108. If we have enough of them, then there will be a morphism between two of them
  109. \speak{MTA}
  110. That's trivial...no no, that's the Vop\v{e}nka's Principle!
  111. How much of them should they there be ?
  112. \speak{I}
  113. Inaccessible cardinal ?
  114. \speak{MTA}
  115. It's obvious, you must have read it somewhere.
  116. We need a proper class of them.
  117. \end{dialogue}
  118.  
  119. End of dialogue.
  120. \medskip
  121.  
  122. I'm not aware that I have read it anywhere.
  123. It just resonated in my mind, that the words Exist and Morphism
  124. abounded all the time, so I just let them be together.
  125.  
  126. Some other dialogue with this assistant professor:
  127.  
  128. \begin{dialogue}
  129. \speak{MTA} So you are interested in set theory? Tell us something about it.
  130. \speak{I}
  131. What is the largest cardinal compatible with $\textsf{V=L}$ ?
  132. \speak{Professor} There were some other people present and one of them paused to ponder
  133. and concluded: A good question.
  134. \end{dialogue}
  135.  
  136. End of dialogue.
  137. \medskip
  138.  
  139. Many years after, I've found a work by Jack Silver: A large cardinal in the constructible universe, answering this question.
  140.  
  141. \medskip
  142. \section{Henk Barendregt book on lambda calculus}
  143. I didn't care to rewrite Henk's email in \LaTeX\ notation.
  144. Just his first paragraph matters for now.
  145.  
  146. \begin{verbatim}
  147. Dear Hynek,
  148.  
  149. You are right. So now you know (at least locally) my book better than me :).
  150. But you do not know yet how to use it. So let me help you.
  151.  
  152. P^arrow being, say, P1,P2 in SO means that both P1 in SO and P2 in SO.
  153. Then \x0.x0P1P2 in SO.
  154. So my example below should have been
  155. \x0x1.x0 I (x1 I I I) in SO.
  156.  
  157. Best wishes, Henk
  158. \end{verbatim}
  159.  
  160. \end{document}\def\extrasenglish{} % for varioref bug https://github.com/latex3/latex2e/issues/2112
  161.  
  162. % 1. Ošetření načítání fontspec
  163. \PassOptionsToPackage{no-math}{fontspec}
  164.  
  165. % 2. BLOKÁDA KAOFONTS: Přinutíme LaTeX si myslet, že kaofonts.sty už byl načten.
  166. % Tím se zcela vyhnes hledání chybějícího fontu "Libertinus Serif".
  167. \makeatletter
  168. \expandafter\def\csname [email protected]\endcsname{}
  169. \makeatother
  170.  
  171. \documentclass[
  172.    a4paper,
  173.    fontsize=10pt,
  174.    twoside=true,
  175.    nofonts,
  176. ]{kaobook}
  177.  
  178. \usepackage{iftex}
  179. \usepackage{fontspec}
  180.  
  181. % 3. Definuješ vlastní dostupné fonty
  182. \setmainfont{TeX Gyre Termes}
  183. \setsansfont{TeX Gyre Heros}
  184. \setmonofont{TeX Gyre Cursor}
  185.  
  186. % 4. OPRAVA PRO BALÍČEK DIALOGUE (\providelength collision fix)
  187. \let\providelength\undefined
  188. \usepackage{dialogue}
  189.  
  190. % Choose the language
  191. \ifxetexorluatex
  192.     \usepackage{polyglossia}
  193.    \setmainlanguage{english}
  194. \else
  195.    \usepackage[english]{babel}
  196. \fi
  197.  
  198. \usepackage[english=british]{csquotes} % English quotes
  199.  
  200. \usepackage{amsmath,amssymb}
  201. \usepackage{mathrsfs}
  202.  
  203. \usepackage{imakeidx}
  204. \usepackage{enumitem}
  205. \usepackage{etoolbox}
  206.  
  207. \makeindex
  208.  
  209. \begin{document}
  210.  
  211. % Fiktivní položky pro zklidnění BibTeXu a MakeIndexu v editoru:
  212. \nocite{*}
  213. \index{dummy}
  214.  
  215. \medskip
  216. \section{Lane Hemaspaandra}
  217. dear hynek
  218.  
  219. again, thanks, and warmest wishes to you. (I don't know if you already have a Ph.D., but if you don't and you are ever are looking to get one, please do consider University of Rochester, and if you do, please let me know so I can make sure the admissions committee doesn't fail to notice yours amidst the hundreds of applications. My most recent Ph.D. graduate, Piotr Faliszewski, who graduated 1.5 years ago and became an assistant professor in Krakow, Poland, came to UR because he send me some comments on The Complexity Companion, and from the correspondence that grew, he applied here, was accepted, did great research and a great Ph.D. thesis, and we now have a slew of joint papers, and a close ongoing research collaboration.)
  220.  
  221. \medskip
  222. {\flushright lane}
  223. \medskip
  224.  
  225. \section{A short story from the computational complexity exam}
  226. One day, at the exam from computational complexity, our teacher gave us
  227. a task and waited for our completing it.
  228.  
  229. I returned to her an empty paper after about an hour of work.
  230. I claimed that for one of the questions the alleged proof I was supposed to carry out was not valid. After a while she spotted a gap in it:
  231. the negation of satisfiable formula may not be unsatisfiable and told
  232. me that I was right. But, she said, why did you started to solve
  233. the 6th out of 7 questions which was by chance incorrectly assigned ?
  234.  
  235. I replied, there was something immediately strange in this assignment.
  236.  
  237. \medskip
  238. \section{Dana Scott}
  239. In 2008 I have asked the following question to FOM forum:
  240.  
  241. I have a question regarding Axiom of Choice.
  242. What is the strength of the following two theories
  243.  
  244. \begin{enumerate}
  245.  \item \label{eq:pyth1} $\textsf{ZF}+\{\text{on every filter, there is a selector}\}$
  246.  \item \label{eq:pyth2} $\textsf{ZF}+\{\text{on every ultrafilter, there is a selector}\}$
  247. \end{enumerate}
  248.  
  249. Professor Dana Scott comments on the question:
  250.  
  251. \begin{dialogue}
  252. \speak{Dana Scott} How did the question come up?
  253. Why don't you sign your whole name on FOM, so people know who you are?
  254. \speak{Me} I'm interested in $\textsf{ZFC}$ (and other foundational issues), and from time to time have a question on the subject;
  255. but currently have no leadership...
  256. \speak{Dana Scott} Tarski would have liked this question.
  257. \end{dialogue}
  258.  
  259. End of dialogue.
  260.  
  261. \section{A few observations around the time of my graduation}
  262. My Master Thesis Advisor once asked me:
  263.  
  264. \begin{dialogue}
  265. \speak{MTA} Tell me something about semigroups.
  266. \speak{I}
  267. If we have enough of them, then there will be a morphism between two of them
  268. \speak{MTA}
  269. That's trivial...no no, that's the Vop\v{e}nka's Principle!
  270. How much of them should they there be ?
  271. \speak{I}
  272. Inaccessible cardinal ?
  273. \speak{MTA}
  274. It's obvious, you must have read it somewhere.
  275. We need a proper class of them.
  276. \end{dialogue}
  277.  
  278. End of dialogue.
  279. \medskip
  280.  
  281. I'm not aware that I have read it anywhere.
  282. It just resonated in my mind, that the words Exist and Morphism
  283. abounded all the time, so I just let them be together.
  284.  
  285. Some other dialogue with this assistant professor:
  286.  
  287. \begin{dialogue}
  288. \speak{MTA} So you are interested in set theory? Tell us something about it.
  289. \speak{I}
  290. What is the largest cardinal compatible with $\textsf{V=L}$ ?
  291. \speak{Professor} There were some other people present and one of them paused to ponder
  292. and concluded: A good question.
  293. \end{dialogue}
  294.  
  295. End of dialogue.
  296. \medskip
  297.  
  298. Many years after, I've found a work by Jack Silver: A large cardinal in the constructible universe, answering this question.
  299.  
  300. \medskip
  301. \section{Henk Barendregt book on lambda calculus}
  302. I didn't care to rewrite Henk's email in \LaTeX\ notation.
  303. Just his first paragraph matters for now.
  304.  
  305. \begin{verbatim}
  306. Dear Hynek,
  307.  
  308. You are right. So now you know (at least locally) my book better than me :).
  309. But you do not know yet how to use it. So let me help you.
  310.  
  311. P^arrow being, say, P1,P2 in SO means that both P1 in SO and P2 in SO.
  312. Then \x0.x0P1P2 in SO.
  313. So my example below should have been
  314. \x0x1.x0 I (x1 I I I) in SO.
  315.  
  316. Best wishes, Henk
  317. \end{verbatim}
  318.  
  319. \end{document}
  320.  
  321.  
  322.  
Advertisement
Add Comment
Please, Sign In to add comment