Substructural Logics with Mingle

Authors:
Norihiro Kamide
Affiliations:
Wakayama National College of Technology, Noshima 77, Nada, Gobo, Wakayama 644-0023, Japan. E-mail: kamide@wakayama-nct.ac.jp
Venue:
Journal of Logic, Language and Information
Year:
2002

Citing 1
Cited 2

Linear logic

Theoretical Computer Science

Kripke Semantics for Modal Substructural Logics

Journal of Logic, Language and Information
A logic for conceptual hierarchies

SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce structural rules mingle, and investigatetheorem-equivalence, cut- eliminability, decidability, interpolabilityand variable sharing property for sequent calculi having the mingle.These results include new cut-elimination results for the extendedlogics: FLm (full Lambek logic with the mingle), GLm(Girard's linear logic with the mingle) and Lm (Lambek calculuswith restricted mingle).