XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week4.mdwn;h=2fa501c6bf204324cf38fbe5f9d5fd0c2ad3f69f;hp=aa0fcf74367f9a2e1ff08b11b6f6a6876b1353b7;hb=8eb66bfd3d6eec21e1a4d31a244200e80e73e888;hpb=b8b608cf4676719fe8102794b4ffd48d1ea0a329
diff git a/week4.mdwn b/week4.mdwn
index aa0fcf74..2fa501c6 100644
 a/week4.mdwn
+++ b/week4.mdwn
@@ 1,9 +1,6 @@
[[!toc]]
#These notes return to the topic of fixed point combiantors for one more return to the topic of fixed point combinators#

#Q: How do you know that every term in the untyped lambda calculus has
a fixed point?#
+#Q: How do you know that every term in the untyped lambda calculus has a fixed point?#
A: That's easy: let `T` be an arbitrary term in the lambda calculus. If
`T` has a fixed point, then there exists some `X` such that `X <~~>