{"title":"并发游戏和完整","authors":"S. Abramsky, Paul-André Melliès","doi":"10.1109/LICS.1999.782638","DOIUrl":null,"url":null,"abstract":"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 Multiplicative-Additive Linear Logic is proved for this semantics.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"378 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"201","resultStr":"{\"title\":\"Concurrent games and full completeness\",\"authors\":\"S. Abramsky, Paul-André Melliès\",\"doi\":\"10.1109/LICS.1999.782638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 Multiplicative-Additive Linear Logic is proved for this semantics.\",\"PeriodicalId\":352531,\"journal\":{\"name\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"volume\":\"378 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"201\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1999.782638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1999.782638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 Multiplicative-Additive Linear Logic is proved for this semantics.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
