{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:03:38Z","timestamp":1648857818294},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11520,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1016\/0304-3975(82)90025-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"259-278","source":"Crossref","is-referenced-by-count":21,"title":["A complete logic for reasoning about programs via nonstandard model theory II"],"prefix":"10.1016","volume":"17","author":[{"given":"H.","family":"Andr\u00e9ka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"N\u00e9meti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Sain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90025-1_BIB1","article-title":"More complete logics for reasoning about programs","author":"Andr\u00e9ka","year":"1980","journal-title":"Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/0304-3975(82)90025-1_BIB2","first-page":"1","article-title":"On a proof of Shelah","volume":"26","author":"Andr\u00e9ka","year":"1976","journal-title":"Bull. Acad. Polon. Sci. Ser. Sci. Math."},{"key":"10.1016\/0304-3975(82)90025-1_BIB3","series-title":"Mathematical Foundations of Computer Science MFCS '81","article-title":"A characterization of Floyd provable programs","author":"Andr\u00e9ka","year":"1981"},{"key":"10.1016\/0304-3975(82)90025-1_BIB4","first-page":"115","article-title":"Completeness of Floyd logic","volume":"7","author":"Andr\u00e9ka","year":"1978","journal-title":"Bull. Section of Logic, Wroclaw"},{"key":"10.1016\/0304-3975(82)90025-1_BIB5","series-title":"Mathematical Foundations of Computer Science 1979","first-page":"208","article-title":"Completeness problems in verification of programs and program schemes","volume":"74","author":"Andr\u00e9ka","year":"1979"},{"key":"10.1016\/0304-3975(82)90025-1_BIB6","series-title":"Fundamentals of Computation Theory FCT' 79","first-page":"18","article-title":"Henkin-type semantics for program schemes to turn negative results to positive","author":"Andr\u00e9ka","year":"1979"},{"key":"10.1016\/0304-3975(82)90025-1_BIB7","author":"Bir\u00f3","year":"1979","journal-title":"Model theoretic investigation of program verification"},{"key":"10.1016\/0304-3975(82)90025-1_BIB8","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(82)90025-1_BIB9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90025-1_BIB10","article-title":"Completeness of Floyd-Hoare program verification","author":"Csirmaz","year":"1980","journal-title":"Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/0304-3975(82)90025-1_BIB11","first-page":"148","article-title":"On definability in Peano Arithmetic","volume":"8","author":"Csirmaz","year":"1979","journal-title":"Bull. Section of Logic, Wroclaw"},{"key":"10.1016\/0304-3975(82)90025-1_BIB12","first-page":"21","article-title":"A survey of semantics of Floyd-Hoare derivability","volume":"14","author":"Csirmaz","year":"1980","journal-title":"CL & CL\u2014Comput. Linguist. Comput. Lang."},{"key":"10.1016\/0304-3975(82)90025-1_BIB13","unstructured":"L. Csirmaz, On the completeness of proving partial correctness, Acta Cybernet. to appear."},{"key":"10.1016\/0304-3975(82)90025-1_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(81)90076-1","article-title":"Programs and program verifications in a general setting","volume":"16","author":"Csirmaz","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90025-1_BIB15","first-page":"31","article-title":"Intensional logic of actions","volume":"12","author":"Ecsedi-T\u00f3th","year":"1978","journal-title":"CL & CL\u2014Comput. Linguist. Comput. Lang."},{"key":"10.1016\/0304-3975(82)90025-1_BIB16","author":"van Emde-Boas","year":"1978","journal-title":"Intensional logic and programming"},{"key":"10.1016\/0304-3975(82)90025-1_BIB17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0003-4843(75)90003-0","article-title":"Model theory for tense logics","volume":"8","author":"Gabbay","year":"1975","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(82)90025-1_BIB18","series-title":"Intensional and Higher Order Modal Logic","author":"Gallin","year":"1978"},{"key":"10.1016\/0304-3975(82)90025-1_BIB19","first-page":"153","article-title":"Completeness of some quantified modal logics","volume":"22","author":"Garson","year":"1979","journal-title":"Logique et Anal."},{"key":"10.1016\/0304-3975(82)90025-1_BIB20","author":"Gergely","year":"1978","journal-title":"Mathematical theory of programming"},{"key":"10.1016\/0304-3975(82)90025-1_BIB21","series-title":"Information Processing 80","first-page":"107","article-title":"Specification of program behaviour through explicit time considerations","author":"Gergely","year":"1980"},{"key":"10.1016\/0304-3975(82)90025-1_BIB22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","article-title":"On the termination of program schemes","volume":"29","author":"Kfoury","year":"1975","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90025-1_BIB23","series-title":"A Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"key":"10.1016\/0304-3975(82)90025-1_BIB24","series-title":"Formal Philosophy: Selected Papers of R. Montague","author":"Montague","year":"1974"},{"key":"10.1016\/0304-3975(82)90025-1_BIB25","first-page":"251","article-title":"There are general rules for specifying semantics: Observations on Abstract Model Theory","volume":"13","author":"Sain","year":"1979","journal-title":"CL & CL\u2014Comput. Linguist. Comput. Lang."},{"key":"10.1016\/0304-3975(82)90025-1_BIB26","volume":"39","year":"1980","journal-title":"Studia Logica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:09Z","timestamp":1555125969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982]]}},"alternative-id":["0304397582900251"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90025-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}