A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi

Studia Logica 48 (1):35 - 39 (1989)
  Copy   BIBTEX

Abstract

In [4], I proved that the product-free fragment L of Lambek's syntactic calculus (cf. Lambek [2]) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut-rule. The proof (which is rather complicated and roundabout) was subsequently adapted by Kandulski [1] to the non-associative variant NL of L (cf. Lambek [3]). It turns out, however, that there exists an extremely simple method of non-finite-axiomatizability proofs which works uniformly for different subsystems of L (in particular, for NL). We present it below to the use of those who refer to the results of [1] and [4].

Links

PhilArchive



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

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

Cut-rule axiomatization of the syntactic calculus L.Wojciech Zielonka - 2001 - Journal of Logic, Language and Information 10 (2):339-352.
Cut-rule axiomatization of the syntactic calculus NL.Wojciech Zielonka - 2000 - Journal of Logic, Language and Information 9 (3):339-352.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.

Analytics

Added to PP
2009-01-28

Downloads
64 (#227,353)

6 months
1 (#1,027,696)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Two Weak Lambek-Style Calculi: DNL and DNL.Wojciech Zielonka - 2012 - Logic and Logical Philosophy 21 (1):53-64.

Add more citations

References found in this work

Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):215-224.

Add more references