{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:18Z","timestamp":1760202498800},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":11186,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0022-0000(82)90013-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"267-284","source":"Crossref","is-referenced-by-count":30,"title":["Expressiveness and the completeness of Hoare's logic"],"prefix":"10.1016","volume":"25","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"J.V.","family":"Tucker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90013-7_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's Logic: a survey\u2014Part 1","volume":"3","author":"Apt","year":"1981","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0022-0000(82)90013-7_BIB2","series-title":"Mathematical theory of program correctness","author":"De Bakker","year":"1980"},{"key":"10.1016\/0022-0000(82)90013-7_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(82)90001-9","article-title":"Floyd's principle, correctness theories and program equivalence","volume":"17","author":"Bergstra","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90013-7_BIB4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(82)90027-5","article-title":"Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs","volume":"17","author":"Bergstra","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90013-7_BIB5","unstructured":"J. A. Bergstra and J. V. Tucker, \u201cHoare's Logic and Peano's Arithmetic,\u201d Mathematical Centre, Theoret. Comp. Sci., to appear."},{"key":"10.1016\/0022-0000(82)90013-7_BIB6","doi-asserted-by":"crossref","unstructured":"J. A. Bergstra and J. V. Tucker, \u201cTwo Theorems About the Completeness of Hoare's Logic,\u201c Inf. Proc. Letters, to appear.","DOI":"10.1016\/0020-0190(82)90095-3"},{"key":"10.1016\/0022-0000(82)90013-7_BIB7","unstructured":"J. A. Bergstra and J. V. Tucker, Hoare's Logic for Programming Languages with Two Data Types, in preparation."},{"key":"10.1016\/0022-0000(82)90013-7_BIB8","article-title":"The Axiomatic Semantics of While-Programs Based on Hoare's Logic","author":"Bergstra","year":"1981","journal-title":"Circulated Notes, Aber Ogwr"},{"key":"10.1016\/0022-0000(82)90013-7_BIB9","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0022-0000(82)90013-7_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/322108.322121","article-title":"Programming language constructs for which it is impossible to obtain good Hoare-like axioms","volume":"26","author":"Clarke","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90013-7_BIB11_1","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\/0022-0000(82)90013-7_BIB11_2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/0210045","article-title":"Corrigendum","volume":"10","author":"Cook","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90013-7_BIB12","series-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0022-0000(82)90013-7_BIB13","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357146.357151","article-title":"Specifying the semantics of while-programs: a trivial and critique of a paper by Hoare and Lauer","volume":"3","author":"Greif","year":"1981","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0022-0000(82)90013-7_BIB14","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/0022-0000(82)90013-7_BIB15","series-title":"Automata, anguages and programming, Seventh Colloquium","first-page":"363","article-title":"Present-day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions","author":"Langmaack","year":"1980"},{"key":"10.1016\/0022-0000(82)90013-7_BIB16","series-title":"Proceedings, 18th IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"A necessary and sufficient condition for the existence of Hoare logics","author":"Lipton","year":"1977"},{"key":"10.1016\/0022-0000(82)90013-7_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","article-title":"Constructive algebras, I.","volume":"16","author":"Mal'cev","year":"1961","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0022-0000(82)90013-7_BIB18","series-title":"A Course in Mathematical Logic","author":"Manin","year":"1977"},{"key":"10.1016\/0022-0000(82)90013-7_BIB19","series-title":"General Equivalence of Expressivity Definitions Using Stonger Postconditions, Respectively Weaker Preconditions","author":"Olderog","year":"1980"},{"key":"10.1016\/0022-0000(82)90013-7_BIB20","first-page":"341","article-title":"Computable algebra, general theory and the theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(82)90013-7_BIB21","series-title":"Mathematical Logic","author":"Schoenfield","year":"1967"},{"key":"10.1016\/0022-0000(82)90013-7_BIB22","first-page":"270","article-title":"Non-Archimedean models for arithmetic","volume":"6","author":"Tennsbaum","year":"1959","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/0022-0000(82)90013-7_BIB23","series-title":"Recursion Theory, Its Generalisations and Applications","article-title":"Computing in algebraic systems","author":"Tucker","year":"1980"},{"key":"10.1016\/0022-0000(82)90013-7_BIB24","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/322047.322062","article-title":"A new incompleteness result for Hoare's system","volume":"25","author":"Wand","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90013-7_BIB25","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","article-title":"An axiomatic definition of the programming language PASCAL","volume":"2","author":"Hoare","year":"1973","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:30Z","timestamp":1550325030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["0022000082900137"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90013-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}