Extending intuitionistic linear logic with knotted structural rules

DOI10.1305/ndjfl/1094061862zbMath0812.03008OpenAlexW2077586596MaRDI QIDQ1344438

V. Pereyra

Publication date: 16 May 1995

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1094061862

zbMATH Keywords

undecidabilitycut eliminationdecidabilityfinite model propertysequent calculicontraction rulerule of inferenceextensions of intuitionistic linear logicweakening rule

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (15)

Connectification for \(n\)-contraction ⋮ Free algebras corresponding to multiplicative classical linear logic and some of its extensions ⋮ A note on standard completeness for some extensions of uninorm logic ⋮ Algebraic proof theory for substructural logics: cut-elimination and completions ⋮ From cut-free calculi to automated deduction: the case of bounded contraction ⋮ Free ordered algebraic structures towards proof theory ⋮ Word problem for knotted residuated lattices. ⋮ Uninorm logic with the \(n\)-potency axiom ⋮ Routes to triviality ⋮ Unnamed Item ⋮ Towards an algorithmic construction of cut-elimination procedures ⋮ The finite model property for knotted extensions of propositional linear logic ⋮ UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS ⋮ The finite embeddability property for noncommutative knotted extensions of RL ⋮ Towards a semantic characterization of cut-elimination

This page was built for publication: Extending intuitionistic linear logic with knotted structural rules