Introduction to linear logic and ludics, part I
| dc.creator | Curien, Pierre-Louis | |
| dc.date | 2005-01-18 | |
| dc.date.accessioned | 2026-07-07T08:10:18Z | |
| dc.date.available | 2026-07-07T08:10:18Z | |
| dc.description | This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with inspiration from and applications to computer science. The present part I covers an introduction to the connectives and proof rules of linear logic, to its decidability properties, and to its models. Part II will deal with proof nets, a graph-like representation of proofs which is one of the major innovations of linear logic, and will present an introduction to ludics. | |
| dc.identifier | https://arxiv.org/abs/cs/0501035 | |
| dc.identifier | http://arxiv.org/abs/cs/0501035 | |
| dc.identifier | Advances in Mathematics (China) 34, 5 (2005) 513-544 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131784 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Introduction to linear logic and ludics, part I | |
| dc.type | text |