Computer Science – Logic in Computer Science
Scientific paper
2008-07-14
Computer Science
Logic in Computer Science
12 pages in two columns, submitted to POPL '09. Uses Paul Taylor's diagrams
Scientific paper
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a ``topological'' game for Multiplicative Additive Linear Logic without propositional variables, including cut moves. We recast the notion of (winning) strategy and the question of cut elimination in this context, and prove a cut elimination theorem. Finally, we prove soundness and completeness. The topology plays a crucial role, in particular through the fact that strategies form a sheaf.
Hirschowitz André
Hirschowitz Michel
Hirschowitz Tom
No associations
LandOfFree
Topological Observations on Multiplicative Additive Linear Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Topological Observations on Multiplicative Additive Linear Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological Observations on Multiplicative Additive Linear Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-443742