- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Linear axiomatics of commutative product-free Lambek calculus
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.Other Versions
No versions found
My notes
Similar books and articles
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
Cut-Rule Axiomatization of the Syntactic Calculus L0.Wojciech Zielonka - 2001 - Journal of Logic, Language and Information 10 (2):233-236.
Cut‐Rule Axiomatization of Product‐Free Lambek Calculus With the Empty String.Wojciech Zielonka - 1988 - Mathematical Logic Quarterly 34 (2):135-142.
On the directional Lambek calculus.Wojciech Zielonka - 2010 - Logic Journal of the IGPL 18 (3):403-421.
Normal form of derivations in the nonassociative and commutative lambek calculus with product.Maciej Kandulski - 1993 - Mathematical Logic Quarterly 39 (1):103-114.
On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars.Maciej Kandulski - 1995 - Mathematical Logic Quarterly 41 (2):217-235.
A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi.Wojciech Zielonka - 1989 - Studia Logica 48 (1):35 - 39.
The finite model property for BCI and related systems.Wojciech Buszkowski - 1996 - Studia Logica 57 (2-3):303 - 323.
Analytics
Added to PP
2009-01-28
Downloads
46 (#484,404)
6 months
6 (#879,768)
2009-01-28
Downloads
46 (#484,404)
6 months
6 (#879,768)
Historical graph of downloads
Citations of this work
Cut-rule axiomatization of the syntactic calculus NL.Wojciech Zielonka - 2000 - Journal of Logic, Language and Information 9 (3):339-352.
References found in this work
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.
Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Mathematical Logic Quarterly 27 (13‐14):215-224.
The logic of types.Wojciech Buszkowski - 1987 - In Jan T. J. Srzednicki (ed.), Initiatives in logic. Boston: M. Nijhoff. pp. 180--206.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-wmc4m dc2