X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_week10_gsv.mdwn;h=76e2e75dda9a4e72277b906bdaa33c02165631d7;hp=f408648c23eeaace3ca3ca4e0ecd9e3012be44cf;hb=4acbb7939d056bff0decf398d1c32dd1c736335f;hpb=f4895699b6d5a76840479ef2149f055bfa02b471

diff --git a/topics/_week10_gsv.mdwn b/topics/_week10_gsv.mdwn
index f408648c..76e2e75d 100644
--- a/topics/_week10_gsv.mdwn
+++ b/topics/_week10_gsv.mdwn
@@ -239,7 +239,7 @@ As usual in dynamic theories, a sequence of sentences is treated as if
 the sentence were conjoined.  This is the same thing as updating with
 the first sentence, then updating with the second sentence.
 Update with *Alice isn't hungry* eliminates the possibility in which
-Alice is hungry (w1), leaving only the possibility containing w2.
+Alice is hungry, leaving only the possibility in which she is full.
 Subsequent update with *Alice might be hungry* depends on the result
 of updating with the prejacent, *Alice is hungry*.  Let's do that side
 calculation: