Phase semantics and Petri net interpretation for resource-sensitive strong negation
type: Item
instance of: scholarly article
title: Phase semantics and Petri net interpretation for resource-sensitive strong negation
zbMATH Open document ID: 1159.03329
author: Norihiro Kamide
published in: Journal of Logic, Language and Information
publication date: 2009-03-24T00:00:00Z
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 92C50
zbMATH DE Number: 5532509
zbMATH Keywords: electric circuit
zbMATH Keywords: linear logic with strong negation
zbMATH Keywords: medical diagnosis
zbMATH Keywords: Petri net with inhibitor arc
zbMATH Keywords: phase semantics
describes a project that uses: Lolli
MaRDI profile type: Publication
full work available at URL: s10849-005-9000-z
OpenAlex ID: W1980108077
cites work: Proofs as processes
cites work: Constructible falsity and inexact predicates
cites work: Universality in quantum computation
cites work: On the \(\pi\)-calculus and linear logic
cites work: Aspects of Paraconsistent Logic
cites work: Process-Algebraic Interpretations of Positive Linear and Relevant Logics
cites work: Completeness results for linear logic on Petri nets
cites work: Linear logic
cites work: BCK-combinators and linear \(\lambda\)-terms have types
cites work: Logic programming in a fragment of intuitionistic linear logic
cites work: The completeness of linear logic for Petri net models
cites work: Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
cites work: Q4807689
cites work: Quantized linear logic, involutive quantales and strong negation
cites work: Q4736520
cites work: Petri nets, Horn programs, linear logic and vector games
cites work: Linear logic as a logic of computations
cites work: Q4484509
cites work: Q4223030
cites work: Q4513584
cites work: From Petri nets to linear logic
cites work: Demonstration of a Fundamental Quantum Logic Gate
cites work: Constructible falsity
cites work: Q4699356
cites work: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
cites work: Logics without the contraction rule
cites work: Q3911403
cites work: Introduction: Paraconsistent logics
cites work: Lectures on Petri nets. 1: Basic models. Advances in Petri nets
cites work: Q4247285
cites work: Q3045257
cites work: Q4495851
cites work: Logic Programming with Strong Negation and Inexact Predicates
cites work: Informational interpretation of substructural propositional logics
cites work: The logic of information structures
cites work: Displaying the modal logic of consistency
cites work: Q4532204
cites work: Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
DOI: 10.1007/S10849-005-9000-Z
description: scientific article; zbMATH DE number 5532509