Abstract
In this paper we continue our study of Girard's Linear Logic and introduce a new Linear Logic with modalities. Our logic describes not only consumption, but presence of resources as well. It describes transformation of resources not only for the single point but for some net, where supplies can be sent from one object to another one using interfaces. We introduce a new semantics and a new calculus for this logic and prove the completeness theorem for this calculus in respect to our semantics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.-Y Girard, Linear Logic. Theoretical computer science, 50:1–102, 1987
J.-Y Girard, La logique linéaire. Pour La Science, Edition Francaise de Scientific American, 150: 74–85, 1990.
S. Abramsky, Intuitionistic Linear Logic Considered as a Programming Language. Preprint, 1990.
Y. Lafont, The linear abstract machine. Theoretical computer science, 59:157–180, 1988.
Y. Lafont, Interaction nets. Proc. 17th ACM Symp. on Principles of Programming Languages, 95–108,1990.
P. Lincoln, J. Mitchell, A. Scerdov, N. Shankar, Decision Problems for Propositional Linear Logic. In Proc. 31th IEEE Symp. Found Comput. Sci., 662–671, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Archangelsky, D.A., Taitslin, M.A. (1992). Modal Linear Logic. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023858
Download citation
DOI: https://doi.org/10.1007/BFb0023858
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive