X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_week6_plexy.mdwn;h=b93c29eb7ac8d258950d8b2d42d74344208acd53;hp=caf3e69d0a02df7c33b681c0c5197e7c3d475b35;hb=92b29e26e2757114e378add97be8ccc111d3fea0;hpb=629e27a98dad2c0c1bb4dbcc246c2d03693ef7c6;ds=sidebyside

diff --git a/topics/_week6_plexy.mdwn b/topics/_week6_plexy.mdwn
index caf3e69d..b93c29eb 100644
--- a/topics/_week6_plexy.mdwn
+++ b/topics/_week6_plexy.mdwn
@@ -47,6 +47,8 @@ meaning.
 more complicated expression that, he argues, refers to Plexy, but this
 nicety is not crucial to our discussion here.)
 
+## Types to the rescue
+
 Kaplan's solution is, in effect, to impose a type system on his
 grammar in such a way that structured meanings cannot be confused with
 the referent of a directly-referential term.  He suggests that the
@@ -65,6 +67,8 @@ class of objects that a directly referential term can refer to, and
 the class of objects that can serve as the complex structure
 corresponding to a DP that is not directly referential.
 
+## Motivating Maybe
+
 Kaplan goes on to use this solution to attack a different problem, the
 problem of non-referring names.  Russell supposed that if a name had
 no referent (e.g., *Santa*), a sentence containing that name would