aboutsummaryrefslogtreecommitdiff
path: root/slides/preplogic-slides.tex
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2020-09-06 19:29:27 +0200
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2020-09-06 19:29:27 +0200
commit7862d4e51530dc1d97fb20b63060d017f04b6a24 (patch)
treeb778c62cd38fa7a4bd239e02c7d64fae684e597c /slides/preplogic-slides.tex
parent92fe0e599cf079aea24fa75af8890fbc05bb078d (diff)
downloadpreplogic-7862d4e51530dc1d97fb20b63060d017f04b6a24.tar.gz
preplogic-7862d4e51530dc1d97fb20b63060d017f04b6a24.zip
Added exercises and some pages to the slides
Diffstat (limited to 'slides/preplogic-slides.tex')
-rw-r--r--slides/preplogic-slides.tex29
1 files changed, 23 insertions, 6 deletions
diff --git a/slides/preplogic-slides.tex b/slides/preplogic-slides.tex
index 5194ebf..dc68c1f 100644
--- a/slides/preplogic-slides.tex
+++ b/slides/preplogic-slides.tex
@@ -350,7 +350,7 @@ Mathematician: ``Yes.''
350 350
351 \begin{itemize} 351 \begin{itemize}
352 \item \textbf{Universal quantifier} ($\forall$ or ``for all''): 352 \item \textbf{Universal quantifier} ($\forall$ or ``for all''):
353 ``$\forall x\in S,\,A(x)$'' means that if we replace $x$ with any 353 ``$\forall x\in S,\,A(x)$'' means that if we replace ``$x$'' with any
354 element of $S$, $A(x)$ is always \textbf{true}. 354 element of $S$, $A(x)$ is always \textbf{true}.
355 \item \textbf{Existential quantifier} ($\exists$ or ``there exists''): 355 \item \textbf{Existential quantifier} ($\exists$ or ``there exists''):
356 ``$\exists x\in S,\, A(x)$'' means that $A(x)$ is \textbf{true} for 356 ``$\exists x\in S,\, A(x)$'' means that $A(x)$ is \textbf{true} for
@@ -385,16 +385,21 @@ Mathematician: ``Yes.''
385 \neg(\exists x\in S,\, A(x))&=\only<1-2>{\quad?} 385 \neg(\exists x\in S,\, A(x))&=\only<1-2>{\quad?}
386 \onslide<3->{\forall x\in S,\,\neg A(x)}\\ 386 \onslide<3->{\forall x\in S,\,\neg A(x)}\\
387 \end{align*} 387 \end{align*}
388 \pause 388 \onslide<2->{
389 \begin{example} 389 \begin{example}
390 \begin{center} 390 \begin{center}
391 $\neg$``every number is even'' = ``there is at least one odd number'' 391 $\neg$``every number is even'' = ``there is at least one odd number''
392 \end{center} 392 \end{center}
393 \end{example} 393 \end{example}
394\end{frame} 394 }
395 395 \onslide<3->{
396\begin{frame} 396 \begin{example}
397 (exercise) 397 \begin{center}
398 $\neg$``$\exists x\in \mathbb N,\, x+3=9$'' =
399 ``$\forall x\in \mathbb N,\, x+3\neq 9$''
400 \end{center}
401 \end{example}
402 }
398\end{frame} 403\end{frame}
399 404
400\section{Proofs} 405\section{Proofs}
@@ -523,4 +528,16 @@ Mathematician: ``Yes.''
523 \end{proof} 528 \end{proof}
524\end{frame} 529\end{frame}
525 530
531\begin{frame}{The end}
532 What you have learned in this course:
533 \begin{itemize}
534 \item Basic logic operations and logic implication
535 \item Quantifiers and \textbf{their negation}
536 \item Some basic mathematical proofs
537 \end{itemize}
538 \vspace{10pt}
539 \refgithub
540\end{frame}
541
542
526\end{document} 543\end{document}

Generated with cgit - Back to sebastiano.tronto.net