The Computational Compexity of Decision Problem in Additive Extensions of Nonassociative Lambek Calculus

Zhe Lin, Minghui Ma

We analyze the complexity of decision problems for Boolean Nonassociative Lambek Calculus admitting empty antecedent of sequents ($\mathsf{BFN}{\mathsf{L}}^{\ast }$), and the consequence relation o…