{"title":"非线性时间模型中的分离","authors":"Amihood Amir","doi":"10.1016/S0019-9958(85)80059-0","DOIUrl":null,"url":null,"abstract":"<div><p>Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce <em>separation</em>—a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Pages 177-203"},"PeriodicalIF":0.0000,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80059-0","citationCount":"5","resultStr":"{\"title\":\"Separation in nonlinear time models\",\"authors\":\"Amihood Amir\",\"doi\":\"10.1016/S0019-9958(85)80059-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce <em>separation</em>—a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"66 3\",\"pages\":\"Pages 177-203\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80059-0\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800590\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce separation—a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
