Skip to content

Fix typos in normal modal and intuitionistic logic #434

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
maxchang3 wants to merge 1 commit into
base: master
Choose a base branch
from
+3 −3
Open

Fix typos in normal modal and intuitionistic logic #434

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion content/intuitionistic-logic/tableaux/soundness.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@
has a closed !!{tableau} then $!B_1, \dots, !B_n \Entails !A$. It is
easier to prove the contrapositive: if for some $\mModel{M}$ and
world~$w$, $\mSat{M}{!B_i}[w]$ for all $i=1$, \dots,~$n$ but
$\mSat{M}{!A}[w]$, then no !!{tableau} can close. Such a
$\mSat/{M}{!A}[w]$, then no !!{tableau} can close. Such a
countermodel shows that the initial assumptions of the !!{tableau}
are satisfiable. The strategy of the proof is to show that whenever
all the prefixed !!{formula}s on !!a{tableau} branch are
Expand Down
2 changes: 1 addition & 1 deletion content/normal-modal-logic/completeness/complete-consistent-sets.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -81,7 +81,7 @@
case~\olref{prop:ccs-closed}.}{}

\item If $\lnot!A \in \Gamma$, then by consistency $!A \notin
\Gamma$; and if $!A \notin \Gamma$ then $!A \in \Gamma$ since
\Gamma$; and if $!A \notin \Gamma$ then $\lnot !A \in \Gamma$ since
$\Gamma$ is complete $\Sigma$-consistent.

\tagitem{prvAnd}{\iftag{probAnd}{Exercise.}{Suppose $!A \land !B \in
Expand Down
2 changes: 1 addition & 1 deletion content/normal-modal-logic/tableaux/soundness.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -28,7 +28,7 @@
has a closed !!{tableau} then $!B_1, \dots, !B_n \Entails !A$. It is
easier to prove the contrapositive: if for some $\mModel{M}$ and
world~$w$, $\mSat{M}{!B_i}[w]$ for all $i=1$, \dots,~$n$ but
$\mSat{M}{!A}[w]$, then no !!{tableau} can close. Such a
$\mSat/{M}{!A}[w]$, then no !!{tableau} can close. Such a
countermodel shows that the initial assumptions of the !!{tableau}
are satisfiable. The strategy of the proof is to show that whenever
all the prefixed !!{formula}s on !!a{tableau} branch are
Expand Down