Abstract
Starting from Girard’s seminal paper on light linear logic (LLL), a number of works investigated on systems derived from linear logic to capture polynomial time computation within the computation-as-cut-elimination paradigm.
The original syntax of LLL is too complicated, mainly because one has to deal with sequents which not just consist of formulas but also of ‘blocks’ of formulas. We circumvent the complications of ‘blocks’ by introducing a new modality \(\nabla\) which is exclusively in charge of ‘additive blocks’. The most interesting feature of this purely multiplicative \(\nabla\) is the possibility of the second-order encodings of additive connectives.
The resulting system (with the traditional syntax), called Easy-LLL, is still powerful to represent any deterministic polynomial time computations in purely logical terms. Unlike the original LLL, Easy-LLL admits polynomial time strong normalization, namely, cut elimination terminates in a unique way in polytime by any choice of cut reduction strategies.
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
Asperti, A.: Light affine logic. In: Proceedings of LICS 1998 (1998)
Asperti, A., Roversi, L.: Intuitionistic Light Affine Logic. ACM Transactions on Computational Logic (TOCL) 3(1), 137–175 (2002)
Atassi, V., Baillot, P., Terui, K.: Verification of Ptime reducibility for system F terms via Dual Light Affine Logic. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 150–166. Springer, Heidelberg (2006)
Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of LICS 2004, pp. 266–275 (2004)
Girard, J.-Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)
Girard, J.-Y., Scedrov, A., Scott, P.: Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science 97, 1–66 (1992)
Girard, J.-Y.: Linear logic: its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, London Mathematical Society Lecture Notes, vol. 222, pp. 1–42. Cambridge University Press, Cambridge (1995)
Girard, J.-Y.: Light linear logic. Information and Computation 143(2), 175–204 (1998)
Kanovich, M., Okada, M., Scedrov, A.: Phase semantics for light linear logic. Theoretical Computer Science 294(3), 525–549 (2003)
Lafont, Y.: Soft Linear Logic and Polynomial Time. Theoretical Computer Science (special issue on Implicit Computational Complexity) 318, 163–180 (2004)
Mairson, H., Terui, K.: On the Computational Complexity of Cut-Elimination in Linear Logic. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol. 2841, pp. 23–36. Springer, Heidelberg (2003)
Mazza, D.: Linear Logic and Polynomial Time. Mathematical Structures in Computer Science 16(6), 947–988 (2006)
Murawski, A.S., Ong, C.-H.L.: On an interpretation of safe recursion in light affine logic. Theoretical Computer Science 318(1/2), 197–223 (2004)
Roversi, L.: A P-time completeness proof for light logics. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 469–483. Springer, Heidelberg (1999)
Terui, K.: Light affine lambda calculus and polytime strong normalization. In: Proceedings of LICS 2001, pp. 209–220 (2001)
Terui, K.: Light logic and polynomial time computation, PhD thesis, Keio University (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanovich, M. (2008). Light Linear Logic with Controlled Weakening. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-92687-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92686-3
Online ISBN: 978-3-540-92687-0
eBook Packages: Computer ScienceComputer Science (R0)