Displacement logic for anaphora
The displacement calculus of Morrill, Valentín and Fadda (2011) [25] aspires to replace the calculus of Lambek (1958) [13] as the foundation of categorial grammar by accommodating intercalation as well as concatenation while remaining free of structural rules and enjoying Cut-elimination and its goo...
| Authors: | , |
|---|---|
| Format: | article |
| Publication Date: | 2014 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/28349 |
| Online Access: | https://hdl.handle.net/2117/28349 https://dx.doi.org/10.1016/j.jcss.2013.05.006 |
| Access Level: | Open access |
| Keyword: | Computational linguistics Anaphora Binding principles Categorial logic Cut-elimination Displacement calculus Negation as failure Lingüística computacional Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural |
| Summary: | The displacement calculus of Morrill, Valentín and Fadda (2011) [25] aspires to replace the calculus of Lambek (1958) [13] as the foundation of categorial grammar by accommodating intercalation as well as concatenation while remaining free of structural rules and enjoying Cut-elimination and its good corollaries. Jäger (2005) [11] proposes a type logical treatment of anaphora with syntactic duplication using limited contraction. Morrill and Valentín (2010) [24] apply (modal) displacement calculus to anaphora with lexical duplication and propose extension with a negation as failure in conjunction with additives to capture binding conditions. In this paper we present an account of anaphora developing characteristics and employing machinery from both of these proposals. |
|---|