Phase semantics and Petri net interpretation for resource-sensitive strong negation

DOI10.1007/S10849-005-9000-ZzbMATH Open1159.03329OpenAlexW1980108077MaRDI QIDQ1006444FDOQ1006444

Authors: Norihiro Kamide 

Publication date: 24 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10849-005-9000-z

Recommendations

• Completeness results for linear logic on Petri nets
• Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
• scientific article; zbMATH DE number 1361538
• scientific article; zbMATH DE number 1231699
• From Petri nets to linear logic

zbMATH Keywords

phase semanticselectric circuitmedical diagnosislinear logic with strong negationPetri net with inhibitor arc

Mathematics Subject Classification ID

Medical applications (general) (92C50) 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)

Cites Work

• Demonstration of a Fundamental Quantum Logic Gate
• The logic of information structures
• Title not available (Why is that?)
• Aspects of Paraconsistent Logic
• Constructible falsity
• Linear logic
• Title not available (Why is that?)
• Logic programming in a fragment of intuitionistic linear logic
• Quantized linear logic, involutive quantales and strong negation
• Completeness results for linear logic on Petri nets
• Title not available (Why is that?)
• Constructible falsity and inexact predicates
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• Linear logic as a logic of computations
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• Logics without the contraction rule
• Title not available (Why is that?)
• Informational interpretation of substructural propositional logics
• Universality in quantum computation
• Petri nets, Horn programs, linear logic and vector games
• Proofs as processes
• On the \(\pi\)-calculus and linear logic
• Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
• Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
• The completeness of linear logic for Petri net models
• From Petri nets to linear logic
• Logic Programming with Strong Negation and Inexact Predicates
• Title not available (Why is that?)
• Introduction: Paraconsistent logics
• Title not available (Why is that?)
• Displaying the modal logic of consistency
• Title not available (Why is that?)
• Process-Algebraic Interpretations of Positive Linear and Relevant Logics
• BCK-combinators and linear \(\lambda\)-terms have types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Constructive negation, implication, and co-implication
• Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
• Linear and affine logics with temporal, spatial and epistemic operators

Uses Software

• Lolli

This page was built for publication: Phase semantics and Petri net interpretation for resource-sensitive strong negation

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