Dynamic non-commutative logic

DOI10.1007/s10849-009-9101-1zbMath1193.03062OpenAlexW2097405534MaRDI QIDQ2268354

Norihiro Kamide

Publication date: 5 March 2010

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-009-9101-1

zbMATH Keywords

completenesssequent calculusdecidabilitydynamic logiccut-eliminationnoncommutative logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05)

Related Items (1)

Bunched sequential information

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Predicate logics without the structure rules
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• The Mathematics of Sentence Structure
• Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials
• Non‐commutative intuitionistic linear logic
• CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT

This page was built for publication: Dynamic non-commutative logic