Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

LICS
1999
IEEE

favoriteEmaildiscussreport

126views Automated Reasoning» more LICS 1999»

Concurrent Games and Full Completeness

13 years 8 months ago

Concurrent Games and Full Completeness

Download web.comlab.ox.ac.uk

A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is proved for this semantics.

Samson Abramsky, Paul-André Melliès

Real-time Traffic

Automated Reasoning | Full Completeness Theorem | Game Semantics | LICS 1999 | Linear Logic |

claim paper

Related Content

» Linear Logic Totality and Full Completeness

» Full Abstraction for Polymorphic PiCalculus

» GameOD an internet based gameondemand framework

» On Timed Alternating Simulation for Concurrent Timed Games

» Reasoning About General Games Described in GDLII

» On the Meaning of Logical Completeness

» SemiperfectInformation Games

» Qualitative Concurrent Stochastic Games with Imperfect Information

» An Esterel processor with full preemption support and its worst case reaction time analysi...

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	LICS
Authors	Samson Abramsky, Paul-André Melliès

Comments (0)