Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


2012 | 21 | 1 | 53-64

Article title

Two Weak Lambek-Style Calculi: DNL and DNL

Title variants

Languages of publication

EN

Abstracts

EN
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.

Year

Volume

21

Issue

1

Pages

53-64

Physical description

Dates

published
2012-03-01
online
2013-07-02

Contributors

  • University of Warmia and Mazury Faculty of Mathematics and Computer Science Żołnierska 14a, 10-561 Olsztyn, Poland

References

  • [1] Belnap, N.D., “Linear logic displayed”, Notre Dame Journal of FormalLogic 31 (1990): 14-25.
  • [2] van Benthem, J., Language in Action. Categories, Lambdas, and DynamicLogic, North Holland, Amsterdam 1991.
  • [3] Buszkowski, W., Logiczne podstawy gramatyk kategorialnychAjdukiewicza-Lambeka, PWN, Warszawa 1989.
  • [4] Buszkowski, W., personal communication.
  • [5] Girard, J.-Y., “Linear logic”, Theoretical Computer Science 50 (1987): 1-102.[WoS]
  • [6] Kandulski, M., “The non-associative Lambek calculus”, pages 141-151 in: Categorial Grammars, W. Buszkowski, W. Marciszewski and J. van Benthem (eds.), Benjamins, Amsterdam 1988.
  • [7] Lambek, J., “The mathematics of sentence structure”, American MathematicalMonthly 65 (1958): 154-170.
  • [8] Lambek, J., “On the calculus of syntactic types”, pages 166-178 in: Structureof Language and its Mathematical Aspects, R. Jakobson (ed.), AMS, Providence 1961.
  • [9] Moortgat, M., Labelled Deductive Systems for categorial theorem proving, OTS Working Papers, CL-92-003, Utrecht.
  • [10] Zielonka, W., “A simple and general method of solving the finite axiomatizability problems for Lambek’s syntactic calculi”, Studia Logica 48 (1989): 35-40.
  • [11] Zielonka, W., “Interdefinability of Lambekian fuctors”, Zeitschrift fürMathematische Logik und Grundlagen der Mathematik 38 (1992): 501-507.
  • [12] Zielonka, W., “On the directional Lambek calculus”, Logic Journal ofIGPL 18 (2010): 403-421.[WoS]

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.doi-10_2478_llc-2012-0004
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.