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

fixed label
Some checks failed
Build latex and deploy / checkout (push) Failing after 13m17s
Details

Browse source
This commit is contained in:
Josia Pietsch 2023-10-24 10:48:41 +02:00
parent 4a27324442
commit fb2c5b2715
Signed by: josia
GPG key ID: E70B571D66986A2D
2 changed files with 7 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
inputs/lecture_01.tex
View file

@ -26,7 +26,7 @@ Literature
\begin{definition} \begin{definition}
Let $A \neq \emptyset$, $B$ be arbitrary sets. Let $A \neq \emptyset$, $B$ be arbitrary sets.
We write $A \le B$ ($A$ is not bigger than $B$ ) We write $A \le B$ ($A$ is not bigger than $B$)
iff there is an injection $f\colon A \hookrightarrow B$. iff there is an injection $f\colon A \hookrightarrow B$.
\end{definition} \end{definition}
\begin{lemma} \begin{lemma}
@ -148,12 +148,12 @@ Literature
\end{proof} \end{proof}
\begin{definition} \begin{definition}
The \vocab{continuum hypothesis} ($\CH$ ) The \vocab{continuum hypothesis} ($\CH$)
says that there is no set $A$ such that says that there is no set $A$ such that
$\N < A < \R$. $\N < A < \R$.
$\CH$ is equivalent to the statement that there is no set $A \subset \R$ $\CH$ is equivalent to the statement that there is no set $A \subset \R$
which is uncountable ($\N < A$ ) which is uncountable ($\N < A$)
and there is no bijection $A \leftrightarrow \R$. and there is no bijection $A \leftrightarrow \R$.
\end{definition} \end{definition}

11
inputs/lecture_03.tex
View file

@ -1,7 +1,7 @@
\lecture{03}{2023-10–23}{Cantor-Bendixson} \lecture{03}{2023-10–23}{Cantor-Bendixson}
\begin{theorem}[Cantor-Bendixson] \begin{theorem}[Cantor-Bendixson]
\yalabel{thm:cantorbendixson}{Cantor-Bendixson}{Cantor-Bendixson} \yalabel{Cantor-Bendixson}{Cantor-Bendixson}{thm:cantorbendixson}
If $A \subseteq \R$ is closed, If $A \subseteq \R$ is closed,
it is either at most countable or else it is either at most countable or else
$A$ contains a perfect set. $A$ contains a perfect set.
@ -29,9 +29,9 @@
\begin{definition} \begin{definition}
Let $A \subseteq \R$. Let $A \subseteq \R$.
We say that $x \in \R$ We say that $x \in \R$
is a \vocab{condensation point} of $A$ is a \vocab{condensation point} of $A$
iff for all $a < x < b$, $(a,b) \cap A$ iff for all $a < x < b$, $(a,b) \cap A$
is uncountable. is uncountable.
\end{definition} \end{definition}
By the fact we just proved, By the fact we just proved,
@ -127,6 +127,3 @@ all condensation points are accumulation points.
% is at most countable. % is at most countable.
% Also $A'$ is closed. % Also $A'$ is closed.
% \end{remark} % \end{remark}