\documentclass[oneside,final,12pt]{book}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}

\begin{center}
\vspace*{\baselineskip}

{\Large Department of Mathematics, BGU}

\vspace*{\baselineskip}

\rule{\textwidth}{1.6pt}\vspace*{-\baselineskip}\vspace*{2pt}
\rule{\textwidth}{0.4pt}\\[\baselineskip]

{\Huge Logic, Set Theory and Topology}\\[0.2\baselineskip]

\rule{\textwidth}{0.4pt}\vspace*{-\baselineskip}\vspace{3.2pt}
\rule{\textwidth}{1.6pt}\\[\baselineskip]

\textbf{On} \emph{Tuesday, April  5, 2016}
\bigskip

\textbf{At} \emph{12:30 -- 13:45}
\bigskip

\textbf{In} \emph{Math -101}

\vspace*{2\baselineskip}

{\large\scshape Dor Marciano 
  %
  (HUJI)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries On the first undefinable ordinal - part 2\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
The argument ``there are only countably many definitions in the language of set theory, therefore there are uncountably many undefinable reals'' is fallacious. The same applies for the argument suggesting that the first undefinable (first order, no parameters) ordinal must be countable, and the two statements are closely linked.
In the paper ``Pointwise definable models of Set Theory'' by Joel Hamkins et all, countable models of set theory are constructed in which every element is definable.
We shall demonstrate a couple of these constructions, 
and then move on to consider models in which there are undefinable ordinals.
We'll show that in well-founded models of V=L there exists a dichotomy: Either the first undefinable ordinal is countable (according to the model), or it does not exist.
We'll construct well-founded models of ZFC (given very low-strength consistency hypotheses) in which the first undefinable ordinal is uncountable (according to the model).
We'll show that the consistency strength of ``The first undefinable ordinal is a cardinal'' is roughly that of an inaccessible cardinal, and that the consistency strength of ``The first undefinable ordinal is a regular cardinal'' is roughly that of a Mahlo cardinal.

Note: The lecture will be given in two sessions. Basic knowledge of forcing is recommended, but not completely required - as notions and facts about the relevant forcings will be stated.








% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
