{"title":"Expressiveness Bounds for Completness in Trace-Based Network Proof Systems","authors":"J. Widom, P. Panangaden","doi":"10.1007/BFb0026105","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium on Trees in Algebra and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0026105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
