Cut Elimination and Decidability for Classical Lambek Logic

DOI10.1093/LOGCOM/EXM063zbMath1138.03020OpenAlexW1998365049MaRDI QIDQ5450573

Mirjana Isaković-Ilić

Publication date: 12 March 2008

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

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

zbMATH Keywords

decidabilitycut-elimination theoremclassical Lambek logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (1)

Strong negation in intuitionistic style sequent systems for residuated lattices

This page was built for publication: Cut Elimination and Decidability for Classical Lambek Logic