Minor edits

This commit is contained in:
Mark 2023-04-02 09:20:18 -07:00
parent 6236cebaed
commit d20ddd26b1
5 changed files with 4 additions and 9 deletions

View File

@ -1,7 +1,7 @@
% use [nosolutions] flag to hide solutions.
% use [solutions] flag to show solutions.
\documentclass[
nosolutions,
solutions,
singlenumbering
]{../../resources/ormc_handout}

View File

@ -12,11 +12,7 @@ This tells us that $I$ is a function that takes its input, $a$, to itself. We'll
To apply functions, put them next to their inputs. We'll omit the usual parentheses to save space.
$$
I ~ \star = (\lm a . a) ~ \star = \star
$$
$$
(M~\star) =
(I~\star) =
(\lm \tzm{b}a. a)~\tzmr{a}\star =
\star
\begin{tikzpicture}[

View File

@ -1,6 +1,6 @@
\section{Boolean Algebra}
The Kestrel selects its first argument, and the Kite selects its second. This \say{choosing} behavior is awfully similar to something you may have already seen...
The Kestrel selects its first argument, and the Kite selects its second. This \say{choosing} behavior is similar to something you may have already seen...
\vspace{1ex}

View File

@ -58,7 +58,7 @@ How about $(8~NOT~F)$?
\problem{}
This handout may remind you of Professor Oleg's handout on Peano's axioms. Good. \\
While you're there, recall the tools we used to build the natural numbers: \\
Recall the tools we used to build the natural numbers: \\
We had a zero element and a \say{successor} operation so that $1 \coloneqq S(0)$, $2 \coloneqq S(1)$, and so on.
\vspace{1ex}

View File

@ -1,7 +1,6 @@
\section{Challenges}
Do \ref{Yfac} first, then finish the rest in any order. \\
Have fun!
\problem{}<Yfac>
Design a recursive factorial function using $Y$. \\