notxia/unibo-ai-notes
1
0
Fork 0
mirror of https://github.com/NotXia/unibo-ai-notes.git synced 2025-12-15 02:52:22 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos <noupdate>

Browse Source
This commit is contained in:
Tian Cheng (Riccardo) Xia
2024-01-20 09:44:05 +01:00
parent 9622aab65a
commit 6a33527de2
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/languages-and-algorithms-for-ai/module2/sections/_propositional_logic.tex
View File

@ -264,7 +264,7 @@ The symbols of propositional logic are:
\begin{prooftree} \begin{prooftree}
\AxiomC{$\psi$} \AxiomC{$\psi$}
\AxiomC{$\varphi$} \AxiomC{$\varphi$}
\RightLabel{$\land$I}\BinaryInfC{$\varphi \land \psi$} \RightLabel{$\land_\text{i}$}\BinaryInfC{$\varphi \land \psi$}
\end{prooftree} \end{prooftree}
\end{minipage} \end{minipage}
\begin{minipage}{.4\linewidth} \begin{minipage}{.4\linewidth}
@ -274,7 +274,7 @@ The symbols of propositional logic are:
\UnaryInfC{\vdots} \UnaryInfC{\vdots}
\noLine \noLine
\UnaryInfC{$\psi$} \UnaryInfC{$\psi$}
\RightLabel{$\Rightarrow$I}\UnaryInfC{$\varphi \Rightarrow \psi$} \RightLabel{$\Rightarrow_\text{i}$}\UnaryInfC{$\varphi \Rightarrow \psi$}
\end{prooftree} \end{prooftree}
\end{minipage} \end{minipage}
@ -283,20 +283,20 @@ The symbols of propositional logic are:
\begin{minipage}{.25\linewidth} \begin{minipage}{.25\linewidth}
\begin{prooftree} \begin{prooftree}
\AxiomC{$\varphi \land \psi$} \AxiomC{$\varphi \land \psi$}
\RightLabel{$\land$E}\UnaryInfC{$\varphi$} \RightLabel{$\land_\text{e}$}\UnaryInfC{$\varphi$}
\end{prooftree} \end{prooftree}
\end{minipage} \end{minipage}
\begin{minipage}{.25\linewidth} \begin{minipage}{.25\linewidth}
\begin{prooftree} \begin{prooftree}
\AxiomC{$\varphi \land \psi$} \AxiomC{$\varphi \land \psi$}
\RightLabel{$\land$E}\UnaryInfC{$\psi$} \RightLabel{$\land_\text{e}$}\UnaryInfC{$\psi$}
\end{prooftree} \end{prooftree}
\end{minipage} \end{minipage}
\begin{minipage}{.3\linewidth} \begin{minipage}{.3\linewidth}
\begin{prooftree} \begin{prooftree}
\AxiomC{$\varphi$} \AxiomC{$\varphi$}
\AxiomC{$\varphi \Rightarrow \psi$} \AxiomC{$\varphi \Rightarrow \psi$}
\RightLabel{$\Rightarrow$E}\BinaryInfC{$\psi$} \RightLabel{$\Rightarrow_\text{e}$}\BinaryInfC{$\psi$}
\end{prooftree} \end{prooftree}
\end{minipage} \end{minipage}
@ -307,7 +307,7 @@ The symbols of propositional logic are:
\AxiomC{$\psi$} \AxiomC{$\psi$}
\AxiomC{$\lnot \psi$} \AxiomC{$\lnot \psi$}
\BinaryInfC{$\bot$} \BinaryInfC{$\bot$}
\RightLabel{$\bot$}\UnaryInfC{$\varphi$} \UnaryInfC{$\varphi$}
\end{prooftree} \end{prooftree}
\item[Reductio ad absurdum] \marginnote{Reductio ad absurdum} \item[Reductio ad absurdum] \marginnote{Reductio ad absurdum}