Journal of Logic, Language and Information 15 (4):371-401 (2006)
|Abstract||Wansing’s extended intuitionistic linear logic with strong negation, called WILL, is regarded as a resource-conscious refinment of Nelson’s constructive logics with strong negation. In this paper, (1) the completeness theorem with respect to phase semantics is proved for WILL using a method that simultaneously derives the cut-elimination theorem, (2) a simple correspondence between the class of Petri nets with inhibitor arcs and a fragment of WILL is obtained using a Kripke semantics, (3) a cut-free sequent calculus for WILL, called twist calculus, is presented, (4) a strongly normalizable typed λ-calculus is obtained for a fragment of WILL, and (5) new applications of WILL in medical diagnosis and electric circuit theory are proposed. Strong negation in WILL is found to be expressible as a resource-conscious refutability, and is shown to correspond to inhibitor arcs in Petri net theory.|
|Keywords||electric circuit linear logic with strong negation medical diagnosis Petri net with inhibitor arc phase semantics|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
M. Spinks & R. Veroff (2008). Constructive Logic with Strong Negation is a Substructural Logic. II. Studia Logica 89 (3):401 - 425.
Dimiter Vakarelov (2005). Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation. Studia Logica 80 (2-3):393 - 430.
Brigitte Hösli & Gerhard Jäger (1994). About Some Symmetries of Negation. Journal of Symbolic Logic 59 (2):473-485.
Motohiko Mouri & Norihiro Kamide (2008). Strong Normalizability of Typed Lambda-Calculi for Substructural Logics. Logica Universalis 2 (2):189-207.
Matthew Spinks & Robert Veroff (2008). Constructive Logic with Strong Negation is a Substructural Logic. I. Studia Logica 88 (3):325 - 348.
Norihiro Kamide (2003). Normal Modal Substructural Logics with Strong Negation. Journal of Philosophical Logic 32 (6):589-612.
Valentin Goranko (1985). The Craig Interpolation Theorem for Prepositional Logics with Strong Negation. Studia Logica 44 (3):291 - 317.
Norihiro Kamide (2004). Quantized Linear Logic, Involutive Quantales and Strong Negation. Studia Logica 77 (3):355 - 384.
Norihiro Kamide (2005). Gentzen-Type Methods for Bilattice Negation. Studia Logica 80 (2-3):265 - 289.
Seiki Akama (1990). Subformula Semantics for Strong Negation Systems. Journal of Philosophical Logic 19 (2):217 - 226.
Added to index2009-01-28
Total downloads6 ( #154,724 of 722,863 )
Recent downloads (6 months)0
How can I increase my downloads?