Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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/proof-theory/natural-deduction/introduction.tex
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@
follows from~$\Gamma$, i.e., $\Gamma \Entails !A$. The inference rules
of natural deduction can naturally be read as telling us something
about such entailments, e.g., \Intro{\lif} says that if $\Gamma + !A
\Entails !B$ then $\Gamma \Entails !B$. It is only natural to
\Entails !B$ then $\Gamma \Entails !A \lif !B$. It is only natural to
formulate the rules directly so that they operate on both the
assumptions and the conclusion that follow from them in the premises
and conclusion of the inference rule, i.e., they operate on sequents
Expand Down
2 changes: 1 addition & 1 deletion content/proof-theory/natural-deduction/quantifiers.tex
Original file line number Diff line number Diff line change
Expand Up @@ -173,7 +173,7 @@
\]
we have replaced a dirty eigenvariable inference by a clean one, and
the only difference is the replacement of the eigenvariable $c$
by~$a$. The resulting proof has $n-1$ dirty eigenvariable inferences,
by~$a$. The resulting proof has fewer than $n$ dirty eigenvariable inferences,
and the result follows from the inductive hypothesis.
\end{proof}

Expand Down