Interaction graphs: multiplicatives

From MaRDI portal
Publication:714715

DOI10.1016/J.APAL.2012.04.005zbMATH Open1252.03143arXiv1205.6558OpenAlexW1971681260MaRDI QIDQ714715FDOQ714715


Authors: Thomas Seiller Edit this on Wikidata


Publication date: 11 October 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Abstract: We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game semantics and the Danos-Regnier interpretation of GoI operators as paths in proof nets. We show how we can retrieve from this locative framework both a categorical semantics for MLL with distinct units and a notion of truth. Moreover, we show how a restricted version of our model can be reformulated in the exact same terms as Girard's latest geometry of interaction. This shows that this restriction of our framework gives a combinatorial approach to J.-Y. Girard's geometry of interaction in the hyperfinite factor, while using only graph-theoretical notions.


Full work available at URL: https://arxiv.org/abs/1205.6558




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Interaction graphs: multiplicatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714715)