Studia Logica 49 (4):515 - 522 (1990)

Abstract
Axiomatics which do not employ rules of inference other than the cut rule are given for commutative product-free Lambek calculus in two variants: with and without the empty string. Unlike the former variant, the latter one turns out not to be finitely axiomatizable in that way.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370162
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,363
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Untersuchungen über das logische Schließen. I.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 35:176–210.
Untersuchungen über das logische Schließen. II.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 39:405–431.
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.
The Logic of Types.Wojciech Buszkowski - 1987 - In Jan T. J. Srzednicki (ed.), Initiatives in Logic. M. Nijhoff. pp. 180--206.

View all 7 references / Add more references

Citations of this work BETA

Cut-Rule Axiomatization of the Syntactic Calculus NL.Wojciech Zielonka - 2000 - Journal of Logic, Language and Information 9 (3):339-352.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
26 ( #418,206 of 2,445,415 )

Recent downloads (6 months)
1 ( #457,259 of 2,445,415 )

How can I increase my downloads?

Downloads

My notes