Concurrent games and full completeness

Abramsky, S; Mellies, P.-A.

doi:10.1109/LICS.1999.782638

Record: found
Abstract: not found
Conference Proceedings: not found

Concurrent games and full completeness

proceedings-article

Author(s): S. Abramsky , P.-A. Mellies

Publication date: 1999

Conference name: Proceedings. 14th Symposium on Logic in Computer Science (LICS-99)

Conference date: 2-5 July 1999

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publication date: 1999

Pages: 431-442

Article

DOI: 10.1109/LICS.1999.782638

SO-VID: a5e83973-eb9c-4468-afc9-322b3f62149a

Conference name: Proceedings. 14th Symposium on Logic in Computer Science

Conference acronym: LICS-99

Conference location: Trento, Italy

Conference date: 2-5 July 1999

History

Data availability:

Comments

Comment on this article

scite_

Cited by 12

Asynchronous Games: Innocence Without Alternation
Authors: Paul-André Melliès, Samuel Mimram
A Game Interpretation of Retractable Contracts
Authors: Franco Barbanera, Ugo de’ Liguoro
Intensionality, Definability and Computation
Authors: Samson Abramsky

See all cited by

Concurrent games and full completeness

Read this article at

Related collections

ScienceOpen Research

Author and article information

Conference

Article

History

Comments

Comment on this article

Similar content 1,007

Cited by 12