Completeness for game logic
- Submitting institution
-
University of Strathclyde
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 89648119
- Type
- E - Conference contribution
- DOI
-
10.1109/LICS.2019.8785676
- Title of conference / published proceedings
- 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Solving this long-standing open problem has led to invitations to speak
at the international workshop “Circularity in Syntax and Semantics” in
November 2019 in Gothenburg/Sweden and at the international workshop in
Coalgebraic Methods in Computer Science 2020. Techniques developed in
the paper led to two successful grant applications: TOP grant
“Derivation Systems for Modal Fixpoint Logic” at ILLC Amsterdam (approx
700k EUR) and "COVER: COalgebraic Foundations for Quantitative
VERification" at Strathclyde (Value approx £414k).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -