Cut Elimination and Decidability for Classical Lambek Logic

摘要

In this article we give a cut elimination procedure for two-sided sequent system of classical Lambek logic and, on the basis of the presented procedure, a new proof of decidability for this logic.