A note on the Lambek-van Benthem calculus

Bulletin of the Section of Logic 13 (1):31-35 (1984)
  Copy   BIBTEX

Abstract

van Benthem [1] introduces a variant of Lambek Syntactic Calculus , proposed by Lambek [6], we call the variant Lambek-van Benthem Calculus . As proved by van Benthem, LBC is complete with respect to a semantics of λ-terms. In this note we indicate other relevant properties of LBC , just supporting some expectations of van Benthem. Given a countable set P r, of primitive types, the set T p, of types, is the smallest one such that: T p contains P r, if x, y are in T p then is in T p. The variables x, y, z will range over types. Expressions X → x are to be called reduction formulas

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

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

Through your library

Similar books and articles

A 'natural logic' inference system using the Lambek calculus.Anna Zamansky, Nissim Francez & Yoad Winter - 2006 - Journal of Logic, Language and Information 15 (3):273-295.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
Cut-rule axiomatization of the syntactic calculus L.Wojciech Zielonka - 2001 - Journal of Logic, Language and Information 10 (2):339-352.
Two Weak Lambek-Style Calculi: DNL and DNL.Wojciech Zielonka - 2012 - Logic and Logical Philosophy 21 (1):53-64.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.

Analytics

Added to PP
2014-01-25

Downloads
39 (#356,630)

6 months
8 (#157,827)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Commutative Lambek Grammars.Tikhon Pshenitsyn - 2023 - Journal of Logic, Language and Information 32 (5):887-936.

Add more citations

References found in this work

No references found.

Add more references