Linear axiomatics of commutative product-free Lambek calculus

Studia Logica 49 (4):515 - 522 (1990)
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
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,511
Through your library
References found in this work BETA
The Logic of Types.Wojciech Buszkowski - 1987 - In Jan T. J. Srzednicki (ed.), Initiatives in Logic. M. Nijhoff. pp. 180--206.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
11 ( #409,306 of 2,180,720 )

Recent downloads (6 months)
5 ( #50,720 of 2,180,720 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums