+ All Categories
Home > Documents > 1.TypeShiing - uni-frankfurt.de

1.TypeShiing - uni-frankfurt.de

Date post: 16-Oct-2021
Category:
Upload: others
View: 3 times
Download: 0 times
Share this document with a friend
31
1. Type Shi+ing
Transcript
Page 1: 1.TypeShiing - uni-frankfurt.de

1.  Type  Shi+ing  

Page 2: 1.TypeShiing - uni-frankfurt.de

Classics  

Montague  (1973)  

Montague  (1973)  

Montague  (1970)  

Montague  (1970)  

Page 3: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  injec1ve  

Page 4: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  preserve  seman1c  substance  

Page 5: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  do  not  add  seman1c  proper1es  

Montague  (1970)  

Page 6: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  (true)  embeddings  

Läuchli  (1970)  

Page 7: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  total  …    

…  and  thus  cannot  be  reversed    

Partee  (1987)  

Partee  (1987)  

Page 8: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  need  not  be  unique  

Montague  (1973)  

Montague  (1973)  

Page 9: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  global    

Page 10: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  uniform  

S1  

S2  

Page 11: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  uniform  across  domains    

Page 12: 1.TypeShiing - uni-frankfurt.de

Type  shi-s  are  purely  formal     …  whatever  that  means:  

 

definable  in  (fragments  of  type  logic),…      

permuta1on  invariant,  …    

         …    

van  Benthem  (1991)  

Page 13: 1.TypeShiing - uni-frankfurt.de

2.  Types  in  dynamic  seman4cs  Indefinites  as  variables  A  farmer  owns  a  donkey        ≈  Sentences  as  predicates  A  farmer  owns  a  donkey    

Page 14: 1.TypeShiing - uni-frankfurt.de

Pardon  my  German  

Page 15: 1.TypeShiing - uni-frankfurt.de

Indefinites  as  variables  A  farmer  owns  a  donkey    

≈    

Cf.  Zimmermann  (1993)  

Page 16: 1.TypeShiing - uni-frankfurt.de

Dynamic  conjuncMon  …  A  farmer  owns  a  donkey.  He  beats  it    

≈    

A  farmer  owns  a  donkey     He  beats  it  

Dynamic  conjuncMoncon[An  

[AND]  

…  as  intersecMon  

Page 17: 1.TypeShiing - uni-frankfurt.de

Dynamic  conjuncMon  …  A  farmer  owns  a  donkey.  He  beats  it    

A  farmer  owns  a  donkey     He  beats  it  

Dynamic  conjuncMoncon[An  

[AND]  

…  as  Cartesian  producMon  

Page 18: 1.TypeShiing - uni-frankfurt.de

Dynamic  conjuncMon  as  type-­‐shiTed  conjuncMon  Intersec1on:            Product  forma1on:  

Dynamic  conjuncMoncon[An  

Cf.  Quine  (1960)  

…  vs.  Bernays  (1957)  

Page 19: 1.TypeShiing - uni-frankfurt.de

Donkeys  Every  farmer  who  owns  a  donkey  beats  it  

DenotaMons  (simplified):  every:    farmer  who  owns  a  donkey:  beats  [it]:  B      

Page 20: 1.TypeShiing - uni-frankfurt.de

Donkeys  Every  farmer  who  owns  a  donkey  beats  it  

Types:  every:  (et)((et)t)  farmer  who  owns  a  donkey:  (e2t)  beats  [it]:  (e2t)  every  farmer  who  owns  a  donkey  ((e2t)t)  every  (e2t)((e2t)t)    

Page 21: 1.TypeShiing - uni-frankfurt.de

Need  for  type  shiT        from  (et)((et)t)  to  (e2t)((e2t)t)        

Page 22: 1.TypeShiing - uni-frankfurt.de

Need  for  type  shiT        from  (et)((et)t)  to  (ent)((ent)t)        

QUESTION  

ARE  THERE  ANY?  

ANSWER:  SURE  …  

Page 23: 1.TypeShiing - uni-frankfurt.de

Need  for  type  shiT        from  (et)((et)t)  to  (ent)((ent)t)        

QUESTION  

ARE  THERE  ANY?  

ANSWER:  SURE  …  

Asymmetric  (weak)  shiT:  no  proporMon  problem,  no  dimes  wasted  …    

Page 24: 1.TypeShiing - uni-frankfurt.de

Need  for  type  shiT        from  (et)((et)t)  to  (ent)((ent)t)        

QUESTION  

ARE  THERE  ANY?  

How  about?  

Lewis  (1975),  Kamp  (1981),  Heim  (1982)  

Page 25: 1.TypeShiing - uni-frankfurt.de

Need  for  type  shi+    

Page 26: 1.TypeShiing - uni-frankfurt.de

…  not  a  domain  shi+    

Page 27: 1.TypeShiing - uni-frankfurt.de

Intended  type  shi+  

Page 28: 1.TypeShiing - uni-frankfurt.de

   …  is  not  unique:      

LHK  type  shi+    

On  a  domain  of  n  individuals  we  may  have:  

or:  

Page 29: 1.TypeShiing - uni-frankfurt.de

   …  can  be  defined  for  invariant  determiners  on  infinite  domain:    

LKH  type  shi+    

…  and  extended  by  gerrymandering:    

Page 30: 1.TypeShiing - uni-frankfurt.de

References  van  Benthem,  Johan:  Language  in  Ac1on.  Amsterdam  1991.  [2nd  ed.,  

 Cambridge,  Mass.,  1995]  Bernays,  Paul:  ‘Über  eine  natürliche  Erweiterung  des  RelaMonenkalkuls’.  In:  A.  

 HeyMng  (ed.),  Construc1vity  in  Mathema1cs.  Amsterdam  1957.  1-­‐14.  Heim,  Irene:  The  Seman1cs  of  Definite  and  Indefinite  Noun  Phrases.  UMass  

 1982.  Kamp,  Hans:  ‘A  Theory  of  Truth  and  SemanMc  RepresentaMon’.  In:  J.  

 Groenendijk  et  al.  (eds.),  Formal  Methods  in  the  Study  of  Language.  Part    1.  Amsterdam  1981.  277-­‐322.  

Läuchli,  H.:  ‘An  abstract  noMon  of  realizability  for  which  intuiMonisMc    predicate  calculus  ist  complete’.  In:  A.  Kind  et  al.  (eds.),  Intui1onism  and    proof  theory.  Amsterdam  and  London  1970.  227-­‐234.  

Lewis,  David  K.:  ‘Adverbs  of  QuanMficaMon’.  In:  E.  L.  Keenan  (ed.),  Formal    Seman1cs  of  Natural  Language.  Cambridge  1975.  3-­‐15.  

Partee,  Barbara:  ‘Noun  Phrase  InterpretaMon  and  Type  ShiTing  Principles’.  In:    J.  Groenendijk  et  al.  (eds.),  Studies  in  Discourse  Representa1on  Theory    and  the  Theory  of  Generalized  Quan1fiers.  Dordrecht  1987.  115-­‐143.  

   

Page 31: 1.TypeShiing - uni-frankfurt.de

Montague,  Richard:  ‘Universal  Grammar’.  Theoria  36  (1970),  373-­‐398.  –:  ‘The  Proper  Treatment  of  QuanMficaMon  in  Ordinary  English’.  In:  J.  HinMkka  

 et  al.  (eds.),  Approaches  to  Natural  Language.  Dordrecht  1973.  221-­‐242.  Quine,  Willard  Van  Orman:  ‘Variables  explained  away’.  Proceedings  of  the  

 American  Philosophical  Society  104  (1960),  343-­‐347.  Zimmermann,  Thomas  Ede:  ‘On  the  Proper  Treatment  of  Opacity  in  Certain  

 Verbs’.  Natural  Language  Seman1cs  1  (1993),  149-­‐179.  


Recommended