Abstract.
We show that every MALL proof-structure [9] satisfies the property of softness, originally a categorical notion introduced by Joyal. Furthermore, we show that the notion of hereditary softness precisely captures Girard’s algebraic restriction of the technical condition on proof-structures. Relying on this characterization, we prove a MALL+Mix sequentialization theorem by a proof-theoretical method, using Girard’s notion of jump. Our MALL+Mix correctness criterion subsumes the Danos/Fleury-Retoré criterion [6] for MLL+Mix.
Similar content being viewed by others
References
Abramsky, S., Melliès, P.-A.: Concurrent Games and Full Completeness. Logic in Computer Science. 431–442, (1999)
Andreoli, J-M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation 2 (3), (1992)
Asperti, A.: Causal Dependencies in Multiplicative Linear Logic with MIX. Mathematical Structures in Computer Science. 5, 351–380 (1995)
Danos, V., Regnier, R.: The structure of Multiplicatives. Archive for Mathematical Logic. 28, 181–203 (1989)
Ehrhard, T.: Hypercoherence: A Strongly Stable Model of Linear Logic. Mathematical Structures in Computer Science. 3, 365–385, (1993). Also appeared in Advances in Linear Logic, ed. by J.-Y. Girard, Y. Lafont, L. Regnier, London Mathematical Society Lecture Note Series (1995)
Fleury, A., Retoré, C.: The mix rule. Mathematical Structures in Computer Science 4, 273–285 (1994)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50, 1–102 (1987)
Girard, J.-Y.: Linear Logic: Its Syntax and Semantics. Advances in Linear Logic, ed. by J.-Y. Girard, Y. Lafont, L. Regnier, London Mathematical Society Lecture Note Series (1995)
Girard, J.-Y.: Proof-Nets: the Parallel Syntax for Proof-Theory. In: Logic and Algebra, A. Ursini, P. Agliano, eds. Lecture Notes in Pure and Applied Mathematics 180, Marcel Dekker, (1996)
Hu, H., Joyal, A.: Coherence completions of categories. In: Girard, Okada and Scedrov (eds.), Theoretical Computer Science. A Special Issue on Linear Logic (partI) 227, 153–184 (1999)
Hughes, D.: Personal email communication, September, 2001
Hughes, D., van Glabbeek, R.: Proof nets for unit-free multiplicative-additive linear logic. Logic in Computer Science. 2003
Joyal, A.: Free bicomplete categories, Math Reports XVII. Acad. Sci. Canada. 219–225 (1995)
Laurent, O.: Polarized Proof-Nets: Proof-Nets for LC (Extended Abstract). LNCS 1581 (TLCA ‘99), 213–227 (1999)
Tortora, L.: de Falco, Additives of linear logic and normalization- Part I: a (restricted) Church-Rosser property, in Girard, Okada and Scedrov (eds.), Theoretical Computer Science. A Special Issue on Linear Logic (partII) 294, 489–524 (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Grant-in-Aid for Young Scientists of Ministry of Education, Science and Culture of Japan.
Mathematics Subject Classification (2000):03F52, 03F07, 03F03
Revised version: 9 August 2003
Rights and permissions
About this article
Cite this article
Hamano, M. Softness of MALL proof-structures and a correctness criterion with Mix. Arch. Math. Logic 43, 751–794 (2004). https://doi.org/10.1007/s00153-004-0222-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-004-0222-6