Abstract
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. Linear Logic is of considerable interest for Computer Science. In this paper we focus on the correlations between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming, and Game Theory. In particular, such a complete correspondence allows us to introduce several new semantics for Linear Logic and to clarify many results on the complexity of natural fragments of Linear Logic.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
