diff --git a/content/proof-theory/natural-deduction/introduction.tex b/content/proof-theory/natural-deduction/introduction.tex index d426355e..58b0e32b 100644 --- a/content/proof-theory/natural-deduction/introduction.tex +++ b/content/proof-theory/natural-deduction/introduction.tex @@ -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 diff --git a/content/proof-theory/natural-deduction/quantifiers.tex b/content/proof-theory/natural-deduction/quantifiers.tex index 752fa9cb..3a18ec42 100644 --- a/content/proof-theory/natural-deduction/quantifiers.tex +++ b/content/proof-theory/natural-deduction/quantifiers.tex @@ -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}