{"title":"乘法加性证明结构的正确性是nl完全的","authors":"Paulin Jacobé de Naurois, Virgile Mogbil","doi":"10.1109/LICS.2008.20","DOIUrl":null,"url":null,"abstract":"The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.","PeriodicalId":298300,"journal":{"name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Correctness of Multiplicative Additive Proof Structures is NL-Complete\",\"authors\":\"Paulin Jacobé de Naurois, Virgile Mogbil\",\"doi\":\"10.1109/LICS.2008.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.\",\"PeriodicalId\":298300,\"journal\":{\"name\":\"2008 23rd Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"2007 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 23rd Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2008.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2008.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Correctness of Multiplicative Additive Proof Structures is NL-Complete
The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
