Lambek Calculus and its relational semantics: Completeness and incompleteness

The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the Lambek Calculus where we admit the empty sequence as the antecedent of a sequent is strongly complete w.r.t. those relational models whereW=U×U for some setU. We will also look into extendability of this completeness result to various fragments of Girard's Linear Logic as suggested in van Benthem (1991), p. 235, and investigate the connection between the Lambek Calculus and language models.

[1]  István Németi,et al.  Algebraization of quantifier logics, an introductory overview , 1991, Stud Logica.

[2]  Bjarni Jónsson,et al.  Relation algebras as residuated Boolean algebras , 1993 .

[3]  Vaughan R. Pratt,et al.  Dynamic algebras as a well-behaved fragment of relation algebras , 1988, Algebraic Logic and Universal Algebra in Computer Science.

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

[5]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[6]  Peter Jipsen,et al.  Adjoining units to residuated Boolean algebras , 1995 .

[7]  Ildikó Sain,et al.  On the Strength of Temporal Proofs , 1989, Theor. Comput. Sci..

[8]  R. Goldblatt.  Logics of Time and Computation , 1987 .

[9]  Hajnal Andréka,et al.  Representations of distributive lattice-ordered semigroups with binary relations , 1991 .

[10]  Johan van Benthem,et al.  Semantic Parallels in Natural Language and Computation , 1989 .

[11]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

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

[13]  Kosta Dosen,et al.  A Brief Survey of Frames for the Lambek Calculus , 1992, Math. Log. Q..

[14]  Ildikó Sain,et al.  Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic , 1988, Algebraic Logic and Universal Algebra in Computer Science.

[15]  B. M. Schein,et al.  Representations of ordered semigroups and lattices by binary relations , 1978 .

[16]  Vaughan R. Pratt,et al.  A roadmap of some two-dimensional logics , 1994 .

[17]  Doug Gurr,et al.  Relations and Non-commutative Linear Logic , 1991 .

[18]  Dirk Roorda,et al.  Dyadic Modalities and Lambek Calculus , 1993 .

[19]  Johan van Benthem,et al.  A note on dynamic arrow logic , 1994 .