25 Hits in 6.2 sec

Quantales as completions of ordered monoids: Revised semantics for Intuitionistic Linear Logic

D. Larchey-Wendling, D. Galmiche
2000 Electronical Notes in Theoretical Computer Science  
doi:10.1016/s1571-0661(05)80733-9 fatcat:iyvwg4xwarbfvmagvfm4vhbesy

Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets

D. Larchey-Wendling, D. Galmiche
1998 Electronical Notes in Theoretical Computer Science  
From the relationships between the notions of ordered m o n o i d and of quantale we de ne a new interpretation of ILL on Petri nets that is complete and veri es the property of nite models.  ...  In the latter case, the correspondence between Intuitionistic Linear Logic ILL and Petri nets illustrates the interest of e cient proof search methods for proving speci cations or properties of distributed  ...  . 2 From ordered monoids to quantales Quantales are to ILL what complete Boolean algebras are to classical logic, or what complete Heyting algebras are to intuitionistic logic.  ... 
doi:10.1016/s1571-0661(05)01180-1 fatcat:grziahhbbjb5xgl5gtiz5e6lku

Page 635 of Mathematical Reviews Vol. , Issue 95b [page]

1995 Mathematical Reviews  
Summary: “We consider partially ordered algebraic structures aris- ing in the semantics of formulas of a noncommutative version of Girard’s linear logic.  ...  As a point of departure he uses intuitionistic propositional logic (IPL) and minimal intuitionistic propositional logic (MPL), which are widely admitted as proper models of informational structures.  ... 

Page 7681 of Mathematical Reviews Vol. , Issue 2001K [page]

2001 Mathematical Reviews  
(F-NANC-LRI; Vandoeuvre-les-Nancy) Quantales as completions of ordered monoids: revised semantics for intuitionistic linear logic.  ...  Therefore we obtain a new semantics based on ordered monoids and also new completeness results for ILL.”  ... 

Relational proof system for linear and other substructural logics

W MacCaull
1997 Logic Journal of the IGPL  
In this paper we give relational semantics and an accompanying relational proof system for a variety of intuitionistic substructural logics, including (intuitionistic) linear logic with exponentials.  ...  of linear logic. To accomplish this, for each extension X of F L we develop a Kripke-style semantics, RelKripke X semantics, as a bridge to relational semantics.  ...  Francis Xavier University Council for Research Grant #91885. The author wishes to thank the referees for their comments and suggestions. 6. SOME OPEN PROBLEMS AND FUTURE DIRECTIONS 697  ... 
doi:10.1093/jigpal/5.5.673 fatcat:ccsg4hf63vctrexgxet3xmrqim

Logic of Dynamics & Dynamics of Logic; Some Paradigm Examples [article]

Bob Coecke, David J. Moore, Sonja Smets
2002 arXiv   pre-print
Focusing on the quantale semantics for dynamic operational quantum logic, we delineate some points of difference with the existing quantale semantics for (non)-commutative linear logic.  ...  On the other hand, an intuitionistic perspective on operational quantum logic, guides us in the direction of incorporating dynamics logically by reconsidering the primitive propositions required to describe  ...  Focusing on the quantale semantics for dynamic operational quantum logic, we delineate some points of difference with the existing quantale semantics for (non)-commutative linear logic.  ... 
arXiv:math/0106059v6 fatcat:5n67ws3lbrgbndd2ikygnfjmj4

Page 6620 of Mathematical Reviews Vol. , Issue 2001I [page]

2001 Mathematical Reviews  
Galmiche, Quantales as completions of ordered monoids: revised semantics for intuitionistic linear logic (15 pp.  ...  Notin, Proof-search and proof nets in mixed linear logic (33 pp. (electronic)).  ... 

Pretopology semantics for bimodal intuitionistic linear logic

C Hartonas
1997 Logic Journal of the IGPL  
We present a complete pretopology semantics for a system of Intuitionistic Linear Logic (commutative or not) where the storage operator is split into a contraction and a weakening component and then recovered  ...  The canonical model construction of 3] is based on and extends the standard phase-space semantics for linear and substructural logics (Troelstra 22], Ono 21]).  ...  This report focuses on a bimodal version of intuitionistic linear logic. We prove a soundness and completeness theorem for the pretopology semantics for Linear Logic developed by G.  ... 
doi:10.1093/jigpal/5.1.65 fatcat:npxhrwl6hvgjfidqda2nknxp6q

Convolution as a Unifying Concept

Brijesh Dongol, Ian J. Hayes, Georg Struth
2016 ACM Transactions on Computational Logic  
A number of examples underpin the universality of these constructions, the most prominent ones being separation logics, where convolution is separating conjunction in an assertion quantale; interval logics  ...  A Hoare logic can be constructed in a generic fashion on the power series quantale, which applies to each of these examples.  ...  We would like to thank Alasdair Armstrong, Kirill Bogdanov, John Derrick, Victor Gomes and Lindsay Groves for discussions of earlier versions.  ... 
doi:10.1145/2874773 fatcat:czhzxgz5xne6xdfjsz2d6q3ka4

Proof-search in type-theoretic languages: an introduction

Didier Galmiche, David J. Pym
2000 Theoretical Computer Science  
points of departure such as a deÿnition of a type-theoretic language or the relationship between languages and proof-objects.  ...  The strong connections between di erent proof-search methods in logics, type theories and logical frameworks, together with their impact on programming and implementation issues, are central in this context  ...  Acknowledgements We are grateful to Maurice Nivat for encouraging us to produce this article and for acting as a referee. Any remaining errors are our responsibility.  ... 
doi:10.1016/s0304-3975(99)00169-3 fatcat:gy4nmmsupfeype23pw3jzbrvwu

Relating State-Based and Process-Based Concurrency through Linear Logic

Iliano Cervesato, Andre Scedrov
2006 Electronical Notes in Theoretical Computer Science  
Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic.  ...  In nearly all cases, the target of these investigations has been linear logic, a formal language that supports a view of formulas as consumable resources.  ...  Acknowledgments We are grateful to Frank Pfenning, Dale Miller, Mark-Oliver Stehr, Valeria de Paiva, Gerald Allwein, Steve Zdancevic and Vijay Saraswat for their comments on various aspects of this work  ... 
doi:10.1016/j.entcs.2006.05.043 fatcat:eavrmrbudjbvbhnu2zlxecsd2e

Relating state-based and process-based concurrency through linear logic (full-version)

Iliano Cervesato, Andre Scedrov
2009 Information and Computation  
Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic and specifically LV obs .  ...  of linear logic that we call LV obs .  ...  of this work.  ... 
doi:10.1016/j.ic.2008.11.006 fatcat:p3nbvcukzbeqrfha4k32llbk4a

Logics without the contraction rule and residuated lattices

Hiroakira Ono
2010 The Australasian Journal of Logic  
Our main technical tool is to use residuated lattices as the algebraic semantics for them.  ...  In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from intuitionistic logics by eliminating the contraction rule.  ...  The system FL e gives a sequent calculus for the intuitionistic linear logic.  ... 
doi:10.26686/ajl.v8i0.1813 fatcat:3e5qatqxp5cixh3nheslskou4m

An Algebraic Semantics for Possibilistic Logic [article]

Luca Boldrin, Claudio Sossai
2013 arXiv   pre-print
The space of truth values for this logic is the lattice of possibility functions, that, from an algebraic point of view, forms a quantal.  ...  A Gentzen calculus is presented, which is proved sound and complete with respect to the given semantics. The problem of truth functionality is discussed in this context.  ...  Acknowledgments We are grateful to Alessandro Saffiotti for several pre cious advices, and to Nino Trainito for a careful read ing of the paper.  ... 
arXiv:1302.4931v1 fatcat:aeeu5dm2lfdrbk2eyyfiazd3je

Subject index volumes 1–200

1999 Theoretical Computer Science  
linear logic, 3580 hardness, 3420 hyper (l)-AFL, 99 implicational dependencies, 1857 interpretations, 88 intuitionistic linear logic, 3257 linear logic, 3580 matrix equivalence problem, 355  ...  509,2175,2225,2317,2636 lazy functional languages, 2270 first-order linear differential systems, 3593 logic, 2574, 3580 first-order linear-time temporal logic, 3049 first-order logic, 823, 1057,2155,2156,2222,2407  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm
« Previous Showing results 1 — 15 out of 25 results