Introduction to linear logic and ludics, part II
Pierre-Louis Curien
Abstract
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and to ludics, which has been recently developped in an aim of further unveiling the fundamental interactive nature of computation and logic. We hope to offer a few computer science insights into this new theory.
Create a lesson
Related papers
Polynomial VASS MDPs
Michal Ajdarow
Proceedings 23rd International Conference on Quantum Physics and Logic
John van de Wetering, Ognyan Oreshkov, Ana Belén Sainz
Final coalgebras over R-modules
Oisín Flynn-Connolly, Henning Basold, Chase Ford
Propositional Dynamic Logic with Program Costs
Krishna Manoorkar, Wolfgang Poiger
Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations
Jiaxin Xie, Guowei Dou, Xiang Ji et al.
Homomorphisms on a product of free convex semilattices
Ana Sokolova, Harald Woracek