diff --git a/content/history/biographies/alonzo-church.tex b/content/history/biographies/alonzo-church.tex index 668933c1e..dbd9c4e84 100644 --- a/content/history/biographies/alonzo-church.tex +++ b/content/history/biographies/alonzo-church.tex @@ -16,7 +16,7 @@ childhood, an air gun incident left Church blind in one eye. He finished preparatory school in Connecticut in 1920 and began his university education at Princeton that same year. He completed his -doctoral studies in 1927. After a couple years abroad, Church returned +doctoral studies in 1927. After a two-year research fellowship, Church returned to Princeton. Church was known to be exceedingly polite and careful. His blackboard writing was immaculate, and he would preserve important papers by carefully covering them in Duco cement (a clear @@ -37,12 +37,12 @@ Church continued his work into old age. In 1967 he left Princeton for UCLA, where he was professor until his retirement in 1990. Church -passed away on August 1, 1995 at the age of 92. +passed away on August 11, 1995 at the age of 92. \begin{reading} For a brief biography of Church, see \citet{EndertonND}. Church's -original writings on the lambda calculus and the Entscheidungsproblem -(Church's Thesis) are \citet{Church1936,Church1936a}. +original writings on the Entscheidungsproblem and on the lambda calculus +and Church's Thesis are \citet{Church1936,Church1936a}. \citet{Aspray1984} records an interview with Church about the Princeton mathematics community in the 1930s. Church wrote a series of book reviews of the \emph{Journal of diff --git a/content/incompleteness/theories-computability/first-incompleteness.tex b/content/incompleteness/theories-computability/first-incompleteness.tex index b9e779ea3..c371fc5de 100644 --- a/content/incompleteness/theories-computability/first-incompleteness.tex +++ b/content/incompleteness/theories-computability/first-incompleteness.tex @@ -24,7 +24,7 @@ \end{proof} \begin{explain} -This theorems is not that far from G\"odel's original 1931 formulation +This theorem is not that far from G\"odel's original 1931 formulation of the First Incompleteness Theorem. Aside from the more modern terminology, the key differences are this: G\"odel has ``$\omega$-consistent'' instead of ``consistent''; and he could not diff --git a/content/incompleteness/theories-computability/interpretability.tex b/content/incompleteness/theories-computability/interpretability.tex index 26cfa778f..56264246a 100644 --- a/content/incompleteness/theories-computability/interpretability.tex +++ b/content/incompleteness/theories-computability/interpretability.tex @@ -62,8 +62,8 @@ symbols, and then one can define $+$ in terms of $\times$ and $'$. So the set of true sentences in the language $\Obj 0$, $'$, $\times$ is undecidable. On the other hand, Presburger has shown that the set of -sentences in the language $\Obj 0$, $'$, $+$ true in the language of -arithmetic is decidable. The procedure is computationally infeasible, +sentences in the language $\Obj 0$, $'$, $+$ true in the standard model +is decidable. The procedure is computationally infeasible, however. \end{document} diff --git a/content/lambda-calculus/syntax/terms.tex b/content/lambda-calculus/syntax/terms.tex index b3fe7c091..410d84bb0 100644 --- a/content/lambda-calculus/syntax/terms.tex +++ b/content/lambda-calculus/syntax/terms.tex @@ -12,7 +12,7 @@ The terms of the lambda calculus are built up inductively from an infinite supply of variables $\Obj{v_0}$, $\Obj{v_1}$, \dots, the symbol~``$\lambd$'', and parentheses. We will use $x$, $y$, $z$, \dots{} -to designate variables, and $M$, $N$, $P$, \dots{} to desginate terms. +to designate variables, and $M$, $N$, $P$, \dots{} to designate terms. \begin{defn}[Terms] \ollabel{defn:term} The set of \emph{terms} of the lambda calculus is defined inductively by: @@ -34,7 +34,7 @@ The terms defined above are fully parenthesized. This can get rather cumbersome, as the term -$(\lambd[x][((\lambd[x][x])(\lambd[x][(xx)]))])$ demnostrates. We will +$(\lambd[x][((\lambd[x][x])(\lambd[x][(xx)]))])$ demonstrates. We will introduce conventions for avoiding parentheses. However, the official definition makes it easy to determine how a term is constructed according to \olref{defn:term}. For example, the last step of forming @@ -45,8 +45,8 @@ abstraction, and so on. \begin{prob} -Describe the formation of $(\lambd[g][(\lambd[x][(g (x x))]) - (\lambd[x][(g (x x))])])$. +Describe the formation of $(\lambd[g][((\lambd[x][(g (x x))]) + (\lambd[x][(g (x x))]))])$. \end{prob} \end{document} diff --git a/content/methods/proofs/reading-proofs.tex b/content/methods/proofs/reading-proofs.tex index 4dbd6d5ae..1837b70ca 100644 --- a/content/methods/proofs/reading-proofs.tex +++ b/content/methods/proofs/reading-proofs.tex @@ -82,8 +82,8 @@ explicit: \begin{proof}{} [By definition of $=$ for sets, $A \cap (A \cup B) = A$ we have to - show (a) $A \cap (A \cup B) \subseteq A$ and (b) $A \cap (A \cup B) - \subseteq A$. (a): By definition of $\subseteq$, we have to show + show (a) $A \cap (A \cup B) \subseteq A$ and (b) $A \subseteq A \cap (A + \cup B)$. (a): By definition of $\subseteq$, we have to show that if $z \in A \cap (A \cup B)$, then $z \in A$.] If $z \in A \cap (A \cup B)$, then $z \in A$ [since by definition of $\cap$, $z \in A \cap (A \cup B)$ iff $z \in A$ and $z \in A \cup B$], so $A @@ -93,7 +93,7 @@ (1) $z \in A$ or $z \in B$, which by definition of $\cup$ means $z \in A \cup B$], and therefore also $z \in A \cap (A \cup B)$ [since the definition of $\cap$ requires that $z \in A$, i.e., (1), and $z - \in A \cup B)$, i.e., (2)]. + \in A \cup B$, i.e., (2)]. \end{proof} \begin{prob} diff --git a/content/proof-theory/natural-deduction/quantifiers.tex b/content/proof-theory/natural-deduction/quantifiers.tex index 752fa9cbd..d039367f7 100644 --- a/content/proof-theory/natural-deduction/quantifiers.tex +++ b/content/proof-theory/natural-deduction/quantifiers.tex @@ -156,11 +156,11 @@ Note that as $c$ is an eigenvariable, it does not occur in~$\lforall[x][!A(x)]$ or an open assumption. The proof $\delta_2$ is regular, since it contains no eigenvariable inferences at all. Let $a$ -be !!a{constant} not occuring in~$\delta$. By +be !!a{constant} not occurring in~$\delta$. By \olref{lem:subst-regular}, $\Subst{\delta_2}{a}{c}$ is a regular proof of $!A(a)$. By the eigenvariable condition, no open assumption of~$\delta_2$ contains~$c$, hence no open assumption -of~$\Subst{\delta_2}{a}{c}$ contains~$a$. Thuse we can +of~$\Subst{\delta_2}{a}{c}$ contains~$a$. Thus we can apply~$\Intro{\lforall}$. If we replace $\delta_1$ in~$\delta$ by the proof $\delta_1'$, \[ diff --git a/content/proof-theory/normalization/permutations.tex b/content/proof-theory/normalization/permutations.tex index c5d65fba6..08f90082a 100644 --- a/content/proof-theory/normalization/permutations.tex +++ b/content/proof-theory/normalization/permutations.tex @@ -279,37 +279,6 @@ \AxiomC{$!D \lor !E$} \AxiomC{$\Discharge{!D}{x}$} \shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$\Discharge{!E}{y}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\DischargeRule{\Elim{\lor}}{x\,y} -\TrinaryInfC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\DisplayProof -$\longrightarrow$\\[6ex] -\AxiomC{$!D \lor !E$} -\AxiomC{$\Discharge{!D}{x}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\AxiomC{$\Discharge{!E}{y}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\DischargeRule{\Elim{\lor}}{x\,y} -\TrinaryInfC{$!C$} -\DisplayProof -\\[10ex] -\AxiomC{$!D \lor !E$} -\AxiomC{$\Discharge{!D}{x}$} -\shortDeduce \DeduceC{$\lforall[x][!B(x)]$} \AxiomC{$\Discharge{!E}{y}$} \shortDeduce diff --git a/content/proof-theory/proof-search/search-algorithm.tex b/content/proof-theory/proof-search/search-algorithm.tex index 71e5f9dae..1e30944dd 100644 --- a/content/proof-theory/proof-search/search-algorithm.tex +++ b/content/proof-theory/proof-search/search-algorithm.tex @@ -21,7 +21,7 @@ !!{formula} in $\Gamma \Sequent \Delta$, or in a sequent produced in the proof search, is ``reduced,'' i.e., it is treated as the principal formula of an inference rule applied backwards, and that this happens -as often as necessary. We call this feature \emph{fairness} +as often as necessary. We call this feature \emph{fairness}. The algorithm works in stages. The output of each stage is a tree of sequents, and the output of the next stage is produced by reducing @@ -43,11 +43,11 @@ the !!{constant}s $\Obj c_0$, $\Obj c_1$, $\Obj c_2$, \dots, using any of the function symbols occurring in~$\Gamma$ and $\Delta$. We assume that the set of all these terms is given in some fixed enumeration, so -that we can talk about, e.g., ``the first !!{constant} not occuring in +that we can talk about, e.g., ``the first !!{constant} not occurring in $\Gamma \Sequent \Delta$.'' Each indexed sequent in the tree the algorithm produces has an associated set of !!{constant}s. The set of !!{constant}s assigned to the sequent in stage~$0$ is the set of all -!!{constant}s occuring in it (if there are any), and $\{\Obj c_0\}$ if +!!{constant}s occurring in it (if there are any), and $\{\Obj c_0\}$ if it contains no !!{constant}s. Suppose the algorithm has generated a tree of indexed sequents, with @@ -130,7 +130,7 @@ \Sequent \Lambda$. All inferences are correct inferences of~\Log{G3c}. This is obvious for the propositional inferences. Observe that at each step, the set~$C$ of !!{constant}s assigned to a sequent contains all -the !!{constant}s occuring in the sequent. Hence, in the reduction +the !!{constant}s occurring in the sequent. Hence, in the reduction using \LeftR{\lexists} and \RightR{\lforall}, the eigenvariable condition is satisfied, since the eigenvariable~$c$ was !!a{constant} not in the set~$C$ assigned to the conclusion, $c$ also did not occur diff --git a/content/proof-theory/propositions-as-types/types.tex b/content/proof-theory/propositions-as-types/types.tex index 91596582b..519d0df7e 100644 --- a/content/proof-theory/propositions-as-types/types.tex +++ b/content/proof-theory/propositions-as-types/types.tex @@ -37,7 +37,7 @@ has type $!A \land !B$. \item If $N$ has type~$!A_1 \land !A_2$, then $\proj{i}{N}$ has type~$!A_i$. \item If $N$ has type $!A$, then - $\inj[!B]{i}{!M}$ has type $!A \lor !B$ if $i=1$ and type $!B \lor + $\inj[!B]{i}{N}$ has type $!A \lor !B$ if $i=1$ and type $!B \lor !A$ if $i=2$. \item If $M$ has type $!A \lor !B$, $N_1$ has type $!C$ relative to $x_1:!A, \Gamma$, and $N_2$ has type~$!C$ relative to $x_2:!B, @@ -61,7 +61,7 @@ $\Gamma$ is~$!A$. The clauses in \olref{defn:type} should seem familiar: they are precisely the rules of \Log{tN2i} with one slight difference: the context~$\Gamma$ is the same throughout. We can codify the -definition as a calculus \Log{tN3i} with the rules given in \olref{tab:tN2ip}. +definition as a calculus \Log{tN3i} with the rules given in \olref{tab:tN3ip}. \subfile{rules-tN3} diff --git a/content/propositional-logic/syntax-and-semantics/valuations-sat.tex b/content/propositional-logic/syntax-and-semantics/valuations-sat.tex index 103c383d0..4314aa466 100644 --- a/content/propositional-logic/syntax-and-semantics/valuations-sat.tex +++ b/content/propositional-logic/syntax-and-semantics/valuations-sat.tex @@ -134,8 +134,7 @@ \ollabel{thm:LocalDetermination} Suppose that $\pAssign{v_1}$ and $\pAssign{v_2}$ are !!{valuation}s that agree on the !!{propositional variable}s occurring in $!A$, i.e., $\pAssign{v_1}(\Obj p_n) = -\pAssign{v_2}(\Obj p_n)$ whenever $\Obj p_n$ occurs in some -!!{formula}~$!A$. Then $\pValue{v_1}$ and $\pValue{v_2}$ also agree +\pAssign{v_2}(\Obj p_n)$ whenever $\Obj p_n$ occurs in~$!A$. Then $\pValue{v_1}$ and $\pValue{v_2}$ also agree on~$!A$, i.e., $\pValue{v_1}(!A) = \pValue{v_2}(!A)$. \end{thm} diff --git a/content/set-theory/cardinals/classing.tex b/content/set-theory/cardinals/classing.tex index 34e255bd9..59dccd950 100644 --- a/content/set-theory/cardinals/classing.tex +++ b/content/set-theory/cardinals/classing.tex @@ -88,7 +88,7 @@ \begin{proof} Let $\alpha$ be an infinite successor ordinal, so $\alpha = \beta -\ordplus 1$ for some $\beta$. By \olref{finitecardisoequal}, $\beta$ +\ordplus 1$ for some $\beta$. By \olref[z][infinity-again]{defnomega}, $\beta$ is also infinite, so $\cardeq{\beta}{\beta \ordplus 1}$ by \olref[ord-arithmetic][using-addition]{ordinfinitycharacter}. Now $\card{\beta} = \card{\beta\ordplus 1} = \card{\alpha}$ by diff --git a/content/set-theory/ord-arithmetic/addition.tex b/content/set-theory/ord-arithmetic/addition.tex index 59350994e..53928e34c 100644 --- a/content/set-theory/ord-arithmetic/addition.tex +++ b/content/set-theory/ord-arithmetic/addition.tex @@ -48,7 +48,7 @@ \beta = \ordtype{\alpha \disjointsum \beta, \rlexless}$. \end{defn} \noindent -Note that we slightly abused notation here; strictly we should write ``$\Setabs{\tuple{x,y}\in \alpha\disjointsum\beta}{x \rlexless y}$'' in place of ``$\rlexless$''. For brevity, though, we will continue to abuse notation in this way in what follows. +Note that we slightly abused notation here; strictly we should write ``$\Setabs{\tuple{x,y}\in (\alpha\disjointsum\beta)^2}{x \rlexless y}$'' in place of ``$\rlexless$''. For brevity, though, we will continue to abuse notation in this way in what follows. The following result, together with \olref[ordinals][ordtype]{thmOrdinalRepresentation}, confirms that our @@ -75,7 +75,7 @@ \begin{proof} Consider the isomorphism $f$ from $\ordsucc{\alpha} = \alpha \cup \{\alpha\}$ to $\alpha\disjointsum1 = (\alpha \times \{0\}) -\disjointsum (\{0\} \times \{1\})$ given by $f(\gamma) = +\cup (\{0\} \times \{1\})$ given by $f(\gamma) = \tuple{\gamma, 0}$ for $\gamma \in \alpha$, and $f(\alpha) = \tuple{0, 1}$. \end{proof} @@ -97,7 +97,7 @@ \begin{align*} \alpha \ordplus 0 & = \ordtype{(\alpha \times \{0\}) \cup (0 \times \{1\}), \rlexless} \\ - &= \ordtype{(\alpha \times \{0\}) \cup \{0\}, \rlexless}\\ + &= \ordtype{\alpha \times \{0\}, \rlexless}\\ &= \alpha\\ \alpha \ordplus (\beta \ordplus 1) %&= \ordtype{(\alpha\times \{0\}) \cup (\ordtype{\beta \ordplus 1}\times \{1\}), \rlexless} \\ diff --git a/content/set-theory/replacement/refproofs.tex b/content/set-theory/replacement/refproofs.tex index 9c8c3e662..2b92e2d97 100644 --- a/content/set-theory/replacement/refproofs.tex +++ b/content/set-theory/replacement/refproofs.tex @@ -144,7 +144,7 @@ \begin{thm}[in $\Z$ + Weak-Reflection]\label{thm:replacement} For any formula $\phi(v,w)$, and any $A$, if $(\forall x \in A)\lexists![y][\phi(x,y)]$, then -$\Setabs{y}{(\exists x \in A)\phi(x,y}$ exists. +$\Setabs{y}{(\exists x \in A)\phi(x,y)}$ exists. \end{thm} \begin{proof} diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index 811246a6f..ea226ee1c 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -108,7 +108,7 @@ Consequently, we again need to define an equivalence relation on the Cauchy sequences, and identify real numbers with equivalence -relations. First we need the idea of a function which tends to $0$ in +classes. First we need the idea of a function which tends to $0$ in the limit. For any function $h : \Nat \to \Rat$, say that \emph{$h$ tends to $0$} iff for any positive $\epsilon \in \Rat$ we have that $(\exists \ell \in \Nat)(\forall n > \ell)|h(n)| < diff --git a/content/sets-functions-relations/arithmetization/checking-details.tex b/content/sets-functions-relations/arithmetization/checking-details.tex index 0ab14ee12..72a66ae5d 100644 --- a/content/sets-functions-relations/arithmetization/checking-details.tex +++ b/content/sets-functions-relations/arithmetization/checking-details.tex @@ -147,7 +147,7 @@ constitutes a \emph{complete} ordered field, i.e., an ordered field with the Completeness Property. Now, \olref[cuts]{realcompleteness} established that $\Real$ has the Completeness Property. However, it -remains to run through the (tedious) of checking that $\Real$ is an +remains to run through the (tedious) task of checking that $\Real$ is an ordered field. Before tearing off into \emph{that} laborious exercise, we need to diff --git a/content/sets-functions-relations/arithmetization/integers.tex b/content/sets-functions-relations/arithmetization/integers.tex index 8049754bb..947caf7f3 100644 --- a/content/sets-functions-relations/arithmetization/integers.tex +++ b/content/sets-functions-relations/arithmetization/integers.tex @@ -52,7 +52,7 @@ \equivrep{a, b}{\Intequiv} \times \equivrep{c, d}{\Intequiv} &= \equivrep{a c + b d, a d + b c}{\Intequiv}\\ \equivrep{a, b}{\Intequiv} \leq \equivrep{c, d}{\Intequiv} &\text{ iff }a + d \leq b + c \end{align*} -(As is common, I'm using `$ab$' stand for `$(a \times b)$', just to make the axioms easier to read.) Now, we need to make sure that these definitions behave as they \emph{ought} to. Spelling out what this means, and checking it through, is rather laborious; we relegate the details to \olref[check]{sec}. But the short point is: everything works! +(As is common, I'm using `$ab$' to stand for `$(a \times b)$', just to make the axioms easier to read.) Now, we need to make sure that these definitions behave as they \emph{ought} to. Spelling out what this means, and checking it through, is rather laborious; we relegate the details to \olref[check]{sec}. But the short point is: everything works! One final thing remains. We have constructed the integers using natural numbers. But this will mean that the natural numbers \emph{are