Type-logical anaphora

We present a type-logical account of anaphora. The principal means is the introduction of type-constructors for `secondary wrap': wrap around the second of two split points in a discontinuous string. We illustrate in terms of preevaluated proof nets, proof nets in which lexico-syntactic interaction is computed in a lexical compilation rather than at the stage of derivation. We suggest that the account offers an explanation of the delay of principle B effect in the child acquisition of anaphora.

[1]  Mark Johnson.  Proof Nets and the Complexity of Processing Center Embedded Constructions , 1998, J. Log. Lang. Inf..

[2]  François Lamarche.  Games semantics for full propositional linear logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Pauline Jacobson.  Towards a Variable-Free Semantics , 1999 .

[4]  M. Moortgat.  Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus , 1988 .

[5]  Glyn Morrill.  Geometry of Lexico-Syntactic Interaction , 1999, EACL.

[6]  Wojciech Buszkowski.  Completeness Results for Lambek Syntactic Calculus , 1986, Math. Log. Q..

[7]  Chien Yu-Chin,et al.  Children's Knowledge of Locality Conditions in Binding as Evidence for the Modularity of Syntax and Pragmatics , 1990 .

[8]  Michael Moortgat,et al.  Categorial Type Logics , 1997, Handbook of Logic and Language.

[9]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[10]  Tanya Reinhart,et al.  Coreference and bound anaphora: A restatement of the anaphora questions , 1983 .

[11]  Dirk Roorda,et al.  Resource Logics : Proof-Theoretical Investigations , 1991 .

[12]  Philippe de Groote.  An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets , 1999, Theor. Comput. Sci..

[13]  Noam Chomsky,et al.  Lectures on Government and Binding , 1981 .

[14]  Mati Pentus.  Language completeness of the Lambek calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[15]  Glyn Morrill,et al.  Incremental processing and acceptability , 2000, CL.

[16]  Glyn Morrill,et al.  Intensionality and boundedness , 1990 .

[17]  J. Lambek.  The Mathematics of Sentence Structure , 1958 .