Two Weak Lambek-Style Calculi: DNL and DNL

Logic and Logical Philosophy 21 (1):53-64 (2012)
  Copy   BIBTEX

Abstract

The calculus DNL results from the non-associative Lambek calculus NL by splitting the product functor into the right (⊲) and left (⊳) product interacting respectively with the right (/) and left () residuation. Unlike NL, sequent antecedents in the Gentzen-style axiomatics of DNL are not phrase structures (i.e., bracketed strings) but functor-argument structures. DNL − is a weaker variant of DNL restricted to fa-structures of order ≤ 1. When axiomatized by means of introduction/elimination rules for / and , it shows a perfect analogy to NL which DNL lacks.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-11-24

Downloads
35 (#652,794)

6 months
11 (#362,865)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
Linear logic displayed.Nuel Belnap - 1989 - Notre Dame Journal of Formal Logic 31 (1):14-25.
Interdefinability of Lambekian functors.Wojciech Zielonka & W. Zielonka - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):501-507.

View all 6 references / Add more references