不管你信不信，AJM的游戏模型是一个经典线性逻辑模型

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI:10.1109/LICS.1997.614933

Patrick Baillot, V. Danos, T. Ehrhard, L. Regnier

{"title":"不管你信不信，AJM的游戏模型是一个经典线性逻辑模型","authors":"Patrick Baillot, V. Danos, T. Ehrhard, L. Regnier","doi":"10.1109/LICS.1997.614933","DOIUrl":null,"url":null,"abstract":"A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"13 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":"{\"title\":\"Believe it or not, AJM's games model is a model of classical linear logic\",\"authors\":\"Patrick Baillot, V. Danos, T. Ehrhard, L. Regnier\",\"doi\":\"10.1109/LICS.1997.614933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.\",\"PeriodicalId\":272903,\"journal\":{\"name\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"13 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"48\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1997.614933\",\"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 of Twelfth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1997.614933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 48

摘要

这就构成了游戏的一般类别。饱和策略的一个子类别，在复制博弈的所有可能编码下关闭，显示在经典线性逻辑中建模约简。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Believe it or not, AJM's games model is a model of classical linear logic

A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量