{"title":"具有重复的滑稽(指数、交互类型和完备性)","authors":"Michele Basaldella, C. Faggian","doi":"10.2168/LMCS-7(2:13)2011","DOIUrl":null,"url":null,"abstract":"We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"52 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Ludics with Repetitions (Exponentials, Interactive Types and Completeness)\",\"authors\":\"Michele Basaldella, C. Faggian\",\"doi\":\"10.2168/LMCS-7(2:13)2011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.\",\"PeriodicalId\":415902,\"journal\":{\"name\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"volume\":\"52 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2168/LMCS-7(2:13)2011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 24th Annual IEEE Symposium on Logic In Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2168/LMCS-7(2:13)2011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
