Hostname: page-component-5d59c44645-l48q4 Total loading time: 0 Render date: 2024-02-21T13:06:19.150Z Has data issue: false hasContentIssue false

Linear logic and polynomial time

Published online by Cambridge University Press:  19 October 2006

Institut de Mathématiques de Luminy (UMR 6206), Campus de Luminy, Case 907 – 13288 Marseille Cedex 9 Email: Homepage:


Light and Elementary Linear Logic, which form key components of the interface between logic and implicit computational complexity, were originally introduced by Girard as ‘stand-alone’ logical systems with a (somewhat awkward) sequent calculus of their own. The latter was later reformulated by Danos and Joinet as a proper subsystem of linear logic, whose proofs satisfy a certain structural condition. We extend this approach to polytime computation, finding two solutions: the first is obtained by a simple extension of Danos and Joinet's condition, closely resembles Asperti's Light Affine Logic and enjoys polystep strong normalisation (the polynomial bound does not depend on the reduction strategy); the second, which needs more complex conditions, exactly corresponds to Girard's Light Linear Logic.

2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)