X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=5d482c4c132c7ffd90512c4d941014536123fe6d;hp=12890be96d4c12b93ef72bc0d45453d6f493a6e8;hb=ea0b194da931da58e613e5af889d65486b104cd2;hpb=259b24b5799d259e2a087b0d065a912ca655afc1

diff --git a/week1.mdwn b/week1.mdwn
index 12890be9..5d482c4c 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -56,7 +56,7 @@ It's possible to enhance the lambda calculus so that functions do get identified
 
 It's often said that dynamic systems are distinguished because they are the ones in which **order matters**. However, there are many ways in which order can matter. If we have a trivalent boolean system, for example---easily had in a purely functional calculus---we might choose to give a truth-table like this for "and":
 
-true and true   = true
+	true and true   = true
 
 And then we'd notice that `* and false` has a different intepretation than `false and *`. (The same phenomenon is already present with the material conditional in bivalent logics; but seeing that a non-symmetric semantics for `and` is available even for functional languages is instructive.)