Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
23 commits
Select commit Hold shift + click to select a range
05e2c5d
permutations.tex: remove the duplicated row of tab:permutation-conver…
KokunoYumeto Nov 15, 2026
8e1c563
types.tex: refer to tab:tN3ip for the rules of tN3i
KokunoYumeto Nov 15, 2026
9128782
cauchy.tex: real numbers are identified with equivalence classes, not…
KokunoYumeto Nov 15, 2026
9875a71
checking-details.tex: add the missing noun in '(tedious) task of chec…
KokunoYumeto Nov 15, 2026
925c6b8
integers.tex: 'using ab to stand for'
KokunoYumeto Nov 15, 2026
aa41124
alonzo-church.tex: Church died on August 11, 1995
KokunoYumeto Nov 15, 2026
a36f30f
alonzo-church.tex: the 1927-29 fellowship was not all spent abroad
KokunoYumeto Nov 15, 2026
c95bfae
alonzo-church.tex: do not equate the Entscheidungsproblem with Church…
KokunoYumeto Nov 15, 2026
ca48398
refproofs.tex: close the parenthesis of phi(x,y)
KokunoYumeto Nov 15, 2026
774f057
terms.tex: fully parenthesize the application in the exercise term
KokunoYumeto Nov 15, 2026
dc0931b
terms.tex: fix 'desginate' and 'demnostrates'
KokunoYumeto Nov 15, 2026
10ac5e7
addition.tex: the tagged components of alpha + 1 are joined by union,…
KokunoYumeto Nov 15, 2026
bce5cca
addition.tex: 0 x {1} is empty, not {0}
KokunoYumeto Nov 15, 2026
3db1441
addition.tex: the restricted relation ranges over pairs in (alpha + b…
KokunoYumeto Nov 15, 2026
84e5150
classing.tex: beta is infinite because omega is closed under successo…
KokunoYumeto Nov 15, 2026
35ad7ec
interpretability.tex: Presburger: true in the standard model, not 'in…
KokunoYumeto Nov 15, 2026
46e5c20
reading-proofs.tex: part (b) is the reverse inclusion
KokunoYumeto Nov 15, 2026
3b139da
reading-proofs.tex: remove a stray parenthesis
KokunoYumeto Nov 15, 2026
635fcff
valuations-sat.tex: Local Determination: variables occurring in A, no…
KokunoYumeto Nov 15, 2026
f7c55eb
first-incompleteness.tex: 'This theorem is'
KokunoYumeto Nov 15, 2026
d302fae
search-algorithm.tex: 'occurring' (3x) and a missing full stop
KokunoYumeto Nov 15, 2026
537d89f
quantifiers.tex: 'occurring', 'Thus'
KokunoYumeto Nov 15, 2026
2353c69
types.tex: inj_i applies to the term N whose type is given
KokunoYumeto Nov 15, 2026
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
8 changes: 4 additions & 4 deletions content/history/biographies/alonzo-church.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand All @@ -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
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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}
8 changes: 4 additions & 4 deletions content/lambda-calculus/syntax/terms.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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:
Expand All @@ -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
Expand All @@ -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}
6 changes: 3 additions & 3 deletions content/methods/proofs/reading-proofs.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand All @@ -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}
Expand Down
4 changes: 2 additions & 2 deletions content/proof-theory/natural-deduction/quantifiers.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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'$,
\[
Expand Down
31 changes: 0 additions & 31 deletions content/proof-theory/normalization/permutations.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
8 changes: 4 additions & 4 deletions content/proof-theory/proof-search/search-algorithm.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand All @@ -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
Expand Down Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions content/proof-theory/propositions-as-types/types.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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,
Expand All @@ -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}

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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}

Expand Down
2 changes: 1 addition & 1 deletion content/set-theory/cardinals/classing.tex

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@timbutton can you check this change?

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I endorse this change!

Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
6 changes: 3 additions & 3 deletions content/set-theory/ord-arithmetic/addition.tex

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@timbutton can you check this change?

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I endorse this change!

Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand All @@ -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}
Expand All @@ -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} \\
Expand Down
2 changes: 1 addition & 1 deletion content/set-theory/replacement/refproofs.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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)| <
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down