Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic

Authors:
Paul-Andre Mellies
Affiliations:
-
Venue:
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Year:
2005

Citing 0
Cited 11

Least and Greatest Fixpoints in Game Semantics

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Contraction-free Proofs and Finitary Games for Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus

Theoretical Computer Science
On abstract resource semantics and computability logic

Journal of Computer and System Sciences
From Focalization of Logic to the Logic of Focalization

Electronic Notes in Theoretical Computer Science (ENTCS)
Understanding Game Semantics Through Coherence Spaces

Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing in asynchronous games

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Preface

Theoretical Computer Science
Musings around the geometry of interaction, and coherence

Theoretical Computer Science
On Concurrent Games with Payoff

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct a denotational model of propositional linear logic based on asynchronous games and winning uniform innocent strategies. Every formula A is interpreted as an asynchronous game [A] and every proof ? of A is interpreted as a winning uniform innocent strategy [?] of the game [A]. We show that the resulting model is fully complete: every winning uniform innocent strategy ? of the asynchronous game [A] is the denotation [?] of a proof 冒 of the formula A.