On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String

DOI10.1093/logcom/exl041zbMath1157.03007OpenAlexW2002087480MaRDI QIDQ5432673

Wojciech Zielonka

Publication date: 17 December 2007

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exl041

zbMATH Keywords

Lambek calculusaxiomatizabilitycut rule

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (1)

Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms

This page was built for publication: On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String