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

DOI10.1007/s10849-005-9000-zzbMath1159.03329OpenAlexW1980108077MaRDI QIDQ1006444

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

zbMATH Keywords

medical diagnosisphase semanticselectric circuitlinear logic with strong negationPetri net with inhibitor arc

Mathematics Subject Classification ID

Medical applications (general) (92C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (3)

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

Uses Software

• Lolli

Cites Work

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

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