{"title":"论霍尔逻辑的相对完备性","authors":"Michal Grabowski","doi":"10.1016/S0019-9958(85)80010-3","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation <em>I</em> is uniformly dedicable (in <em>I</em>) in the theory of <em>I</em> iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 29-44"},"PeriodicalIF":0.0000,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80010-3","citationCount":"7","resultStr":"{\"title\":\"On relative completeness of Hoare logics\",\"authors\":\"Michal Grabowski\",\"doi\":\"10.1016/S0019-9958(85)80010-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation <em>I</em> is uniformly dedicable (in <em>I</em>) in the theory of <em>I</em> iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"66 1\",\"pages\":\"Pages 29-44\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80010-3\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800103\",\"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/S0019995885800103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation I is uniformly dedicable (in I) in the theory of I iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
