Linear logic as a logic of computations

DOI10.1016/0168-0072(94)90011-6zbMath0804.03004OpenAlexW2082529483MaRDI QIDQ1326780

Max I. Kanovich

Publication date: 16 January 1995

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)90011-6

zbMATH Keywords

reachabilityPetri netsderivabilityMinsky machinescomplexity levelcomputational interpretation of initial fragments of linear logicmany-counter machines

Mathematics Subject Classification ID

Related Items (15)

Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Petri nets, Horn programs, linear logic and vector games ⋮ Linear logic automata ⋮ Debits and Credits in Petri Nets and Linear Logic ⋮ Proof and refutation in MALL as a game ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ Linear logic as a tool for planning under temporal uncertainty ⋮ Collaborative planning with confidentiality ⋮ System NEL is Undecidable ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ Coordination: Reo, Nets, and Logic ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Factorization in generalized power series ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ Connection methods in linear logic and proof nets construction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Petri nets are monoids
• The complexity of the word problems for commutative semigroups and polynomial ideals
• An Algorithm for the General Petri Net Reachability Problem
• Efficient program synthesis: Semantics, logic, complexity
• From petri nets to linear logic

This page was built for publication: Linear logic as a logic of computations