Linear Logics with Communication-merge

DOI10.1093/LOGCOM/EXH029MaRDI QIDQ4673354zbMATH OpenOpenAlexFDO

Authors Norihiro Kamide

Publication date 29 April 2005

Published in Journal Of Logic And Computation (Search for Journal in Brave)

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

zbMATH Keywords

communication-merge rulesconcurrent computationcut-eliminationminglemixmodal intuitionistic linear logicsprocess algebra with communication-merge

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1361538
• Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
• Classical linear logics with mix separation principle
• Relevance Principle for Substructural Logics with Mingle and Strong Negation
• Computational interpretations of linear logic

Cited in

(4)

• Encoding linear logic with interaction combinators
• Linear and affine logics with temporal, spatial and epistemic operators
• Debits and Credits in Petri Nets and Linear Logic
• Classical linear logics with mix separation principle

This page was built for publication: Linear Logics with Communication-merge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673354)