有限树上模态微积分的一个简单的完备性证明

{"title":"有限树上模态微积分的一个简单的完备性证明","authors":"B. T. Cate, G. Fontaine","doi":"10.1007/978-3-642-12032-9_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees\",\"authors\":\"B. T. Cate, G. Fontaine\",\"doi\":\"10.1007/978-3-642-12032-9_12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":119563,\"journal\":{\"name\":\"Fixed Points in Computer Science\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fixed Points in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-12032-9_12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fixed Points in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-12032-9_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}