Cyclic Involutive Distributive Full Lambek Calculus is Decidable

DOI10.1093/LOGCOM/EXQ021zbMath1225.03022OpenAlexW1992270652MaRDI QIDQ3006115

Michał Kozak

Publication date: 10 June 2011

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

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

zbMATH Keywords

cut eliminationdecidabilityinvolutionrelevance logicresiduated latticefull Lambek calculuscyclic fusion

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 (3)

Strong negation in intuitionistic style sequent systems for residuated lattices ⋮ Relation algebras as expanded FL-algebras ⋮ Non-associative, non-commutative multi-modal linear logic

This page was built for publication: Cyclic Involutive Distributive Full Lambek Calculus is Decidable