Abstract
In this paper we introduce a new type of nets with distributed resources: resource transformation nets (RT-nets). A new calculus based on Horn fragment of Multiplicative Linear Logic is proposed for this class of models. Theorem of completness is proved.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arkhangelsky D.A., Dekhtyar M.I., Musikaev I.Kh., Taitslin M.A., Linear Logic For Nets With Bounded Resources, (submitted to LICS'94).
Archangelsky D.A., Taitslin M.A., Linear Logic With Fixed Resources, Annals of Pure and Appl. Math. Logic (to appear).
Girard J.Y., Linear Logic, Theoretical Computer Science 50 (1987), 1–102.
Lafont Y., Interaction Nets, 17th ACM Symp. on Principles of Programming Languages (1990), San Francisco, Cal., 95–108.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekhtyar, A.M. (1994). Multiplicative Linear Logic for resource transformation nets. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive