Abstract
We introduce a multimodal stratified framework MS that generalizes an idea hidden in the definitions of Light Linear/Affine logical systems: “More modalities means more expressiveness”. MS is a set of building-rule schemes that depend on parameters. We interpret the values of the parameters as modalities. Fixing the parameters yields deductive systems as instances of MS, that we call subsystems. Every subsystem generates stratified proof nets whose normalization preserves stratification, a structural property of nodes and edges, like in Light Linear/Affine logical systems. A first result is a sufficient condition for determining when a subsystem is strongly polynomial time sound. A second one shows that the ability to choose which modalities are used and how can be rewarding. We give a family of subsystems as complex as Multiplicative Linear Logic — they are linear time and space sound — that can represent Church numerals and some common combinators on them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Girard, J.Y.: Linear Logic. Theo. Comp. Sci. 50, 1–102 (1987)
Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Trans. Comput. Log. 3(1), 137–175 (2002)
Girard, J.Y.: Light linear logic. Inf. Comput. 143(2), 175–204 (1998)
Dal Lago, U.: Context semantics, linear logic and computational complexity. In: LICS 2006, pp. 169–178. IEEE, Los Alamitos (2006)
Leivant, D., Marion, J.Y.: Lambda-calculus characterisations of polytime. Fund. Inf. 19, 167–184 (1993)
Leivant, D.: Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible Mathematics II, 320–343 (1994)
Roversi, L.: Weak Affine Light Typing is complete with respect to Safe Recursion on Notation. Technical Report 104/08, Dipartimento di Informatica, Torino, C.so Svizzera, n.185 — 10149 Torino — Italy (April 2008)
Baillot, P., Mazza, D.: Linear logic by levels and bounded time complexity. Technical report (January 2008), http://arxiv.org/abs/0801.1253v1
Masini, A.: 2-Sequent Calculus: Intuitionism and Natural Deduction. J. Log. Comput. 3(5), 533–562 (1993)
Martini, S., Masini, A.: On the fine structure of the exponential rule. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 197–210. Cambridge University Press, Cambridge (1995)
Murawski, A.S., Ong, C.H.L.: On an interpretation of safe recursion in light affine logic. Theor. Comput. Sci. 318(1-2), 197–223 (2004)
Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Inf. and Comp. 183, 57–85 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roversi, L., Vercelli, L. (2009). Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. In: Berardi, S., Damiani, F., de’Liguoro, U. (eds) Types for Proofs and Programs. TYPES 2008. Lecture Notes in Computer Science, vol 5497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02444-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02444-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02443-6
Online ISBN: 978-3-642-02444-3
eBook Packages: Computer ScienceComputer Science (R0)