From 7862d4e51530dc1d97fb20b63060d017f04b6a24 Mon Sep 17 00:00:00 2001 From: Sebastiano Tronto Date: Sun, 6 Sep 2020 19:29:27 +0200 Subject: Added exercises and some pages to the slides --- slides/preplogic-slides.tex | 29 +++++++++++++++++++++++------ 1 file changed, 23 insertions(+), 6 deletions(-) (limited to 'slides/preplogic-slides.tex') 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.'' \begin{itemize} \item \textbf{Universal quantifier} ($\forall$ or ``for all''): - ``$\forall x\in S,\,A(x)$'' means that if we replace $x$ with any + ``$\forall x\in S,\,A(x)$'' means that if we replace ``$x$'' with any element of $S$, $A(x)$ is always \textbf{true}. \item \textbf{Existential quantifier} ($\exists$ or ``there exists''): ``$\exists x\in S,\, A(x)$'' means that $A(x)$ is \textbf{true} for @@ -385,16 +385,21 @@ Mathematician: ``Yes.'' \neg(\exists x\in S,\, A(x))&=\only<1-2>{\quad?} \onslide<3->{\forall x\in S,\,\neg A(x)}\\ \end{align*} - \pause + \onslide<2->{ \begin{example} \begin{center} $\neg$``every number is even'' = ``there is at least one odd number'' \end{center} \end{example} -\end{frame} - -\begin{frame} - (exercise) + } + \onslide<3->{ + \begin{example} + \begin{center} + $\neg$``$\exists x\in \mathbb N,\, x+3=9$'' = + ``$\forall x\in \mathbb N,\, x+3\neq 9$'' + \end{center} + \end{example} + } \end{frame} \section{Proofs} @@ -523,4 +528,16 @@ Mathematician: ``Yes.'' \end{proof} \end{frame} +\begin{frame}{The end} + What you have learned in this course: + \begin{itemize} + \item Basic logic operations and logic implication + \item Quantifiers and \textbf{their negation} + \item Some basic mathematical proofs + \end{itemize} + \vspace{10pt} + \refgithub +\end{frame} + + \end{document} -- cgit v1.3