Abstract
We continue our work [5] on the logic of multisets (or on the multiset semantics of linear logic), by interpreting further the additive disjunction ⊔. To this purpose we employ a more general class of processes, called free, the axiomatization of which requires a new rule (not compatible with the full LL), the cancellation rule. Disjunctive multisets are modeled as finite sets of multisets. The ⊔-Horn fragment of linear logic, with the cut rule slightly restricted, is sound with respect to this semantics. Another rule, which is a slight modification of cancellation, added to HF⊔ makes the system sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Girard, J.-Y., ‘Linear Logic’, Theoret. Comput. Sci. 50 (1987), 1–102.
Heckmann, R., ‘Power domains and second-order predicates’, Theoret. Comput. Sci. 111 (1993), 59–88.
Troelstra, A. S., Lectures on Linear Logic, CSLI Lecture Notes No 29, Center for the Study of Language and Information, Stanford University, 1992.
Tzouvaras, A., ‘Objects and their lambda calculus’, Theoret. Comput. Sci., 258 (2001), 209–232.
Tzouvaras, A., ‘The linear logic of multisets’, Logic J. of the IGPL, 6 (1998), 901–916.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tzouvaras, A. The Logic of Multisets Continued: The Case of Disjunction. Studia Logica 75, 287–304 (2003). https://doi.org/10.1023/B:STUD.0000009561.61962.5a
Issue Date:
DOI: https://doi.org/10.1023/B:STUD.0000009561.61962.5a