{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:24:54Z","timestamp":1648794294953},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"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":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90027-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"160-170","source":"Crossref","is-referenced-by-count":6,"title":["Equivalences among logics of programs"],"prefix":"10.1016","volume":"29","author":[{"given":"Albert R.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Tiuryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90027-8_BIB1","series-title":"Mathematical Foundations of Computer Science","first-page":"7","article-title":"An introduction to algorithmic logic; Meta-mathematical investigations in the theory of programs","volume":"Vol. 2","author":"Banachowski","year":"1977"},{"key":"10.1016\/0022-0000(84)90027-8_BIB2","series-title":"Proceedings, Ninth Colloquium on Automata, Languages and Programming","first-page":"48","article-title":"On the power of nondeterminism in dynamic logic","author":"Berman","year":"1982"},{"key":"10.1016\/0022-0000(84)90027-8_BIB3","series-title":"A Programming Logic","author":"Constable","year":"1978"},{"key":"10.1016\/0022-0000(84)90027-8_BIB4","series-title":"Mathematical Theory of Program Correctness","author":"De Bakker","year":"1980"},{"key":"10.1016\/0022-0000(84)90027-8_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","article-title":"Algorithmic properties of structures","volume":"1","author":"Engeler","year":"1967","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90027-8_BIB6","series-title":"Mathematical Centre Tracts (63)","first-page":"57","article-title":"Algorithmic logic","author":"Engeler","year":"1975"},{"key":"10.1016\/0022-0000(84)90027-8_BIB7","series-title":"Proceedings, Conference on Research in Theoretical Programming","first-page":"49","article-title":"On the expressive power of programming logics (Russian)","author":"Erimbetov","year":"1981"},{"issue":"2","key":"10.1016\/0022-0000(84)90027-8_BIB8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(81)90039-6","article-title":"Nondeterministic flowchart programs with recursive procedures: Semantics and correctness","volume":"13","author":"Gallier","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90027-8_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0023017","article-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0022-0000(84)90027-8_BIB10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","article-title":"First-Order Dynamic Logic","author":"Harel","year":"1979"},{"key":"10.1016\/0022-0000(84)90027-8_BIB11","series-title":"Automata, Languages and Programming","first-page":"225","article-title":"Induction rules and termination proofs","author":"Hitchcock","year":"1973"},{"key":"10.1016\/0022-0000(84)90027-8_BIB12","series-title":"Proceedings, 9th International Colloquium on Automata, Languages, and Programming","first-page":"348","article-title":"Results on the propositional ,\u03bc-calculus","author":"Kozen","year":"1982"},{"issue":"3","key":"10.1016\/0022-0000(84)90027-8_BIB13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2307\/2270771","article-title":"Remarks on an infinitary language with constructive formulas","volume":"32","author":"Lopez-Escobar","year":"1967","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(84)90027-8_BIB14","unstructured":"A. R. Meyer, Ten thousand and one logics of programming. EATCS Bull. 11\u201329; M.I.T. LCS TM 150, MIT Laboratory for Computer Science, Cambridge, Mass., February 1980."},{"issue":"2","key":"10.1016\/0022-0000(84)90027-8_BIB15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/322307.322324","article-title":"Axiomatic definitions of programming languages: A theoretical assessment","volume":"29","author":"Meyer","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90027-8_BIB16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0022-0000(81)90016-7","article-title":"Definability in dynamic logic","volume":"23","author":"Meyer","year":"1981","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0022-0000(84)90027-8_BIB17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(82)90071-8","article-title":"Expressing program looping in regular dynamic logic","volume":"18","author":"Meyer","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90027-8_BIB18","series-title":"Proceedings, 12th Annual ACM Symposium on Theory of Computing","first-page":"14","article-title":"Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations","author":"Mirkowska","year":"1980"},{"key":"10.1016\/0022-0000(84)90027-8_BIB19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","article-title":"Finiteness is mu-ineffable","volume":"3","author":"Park","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90027-8_BIB20","series-title":"Proceedings, 17th Symposium on Foundations of Computer Science","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0022-0000(84)90027-8_BIB21","series-title":"Proceedings, 22nd IEEE Symposium on the Foundations of Computer Science","first-page":"421","article-title":"A decidable \u03bc-calculus (preliminary report)","author":"Pratt","year":"1981"},{"key":"10.1016\/0022-0000(84)90027-8_BIB22","first-page":"227","article-title":"Formalized algorithmic languages","volume":"18","author":"Salwicki","year":"1970","journal-title":"Bull. Acad. Polon. Sci. Sir. Math. Astr. Phys."},{"key":"10.1016\/0022-0000(84)90027-8_BIB23","series-title":"A theory of programs, unpublished seminar notes","author":"Scott","year":"1969"},{"key":"10.1016\/0022-0000(84)90027-8_BIB24","series-title":"Logic Colloquium 73","first-page":"445","article-title":"Computing over abstract structures: Serial and parallel procedures and Friedman's effective definitional schemes","author":"Shepherdson","year":"1973"},{"key":"10.1016\/0022-0000(84)90027-8_BIB25","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0019-9958(83)80024-2","article-title":"Deterministic dynamic logic is strictly weaker than dynamic logic","volume":"57","author":"Stolboushkin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(84)90027-8_BIB26","series-title":"Proceedings, Workshop on Logics of Programs","first-page":"198","article-title":"A survey of the logic of effective definitions","author":"Tiuryn","year":"1981"},{"key":"10.1016\/0022-0000(84)90027-8_BIB27","series-title":"Proceedings 22nd IEEE Symposium on Foundations of Computer Science","first-page":"335","article-title":"Unbounded program memory adds to expressive power of first-order dynamic logic","author":"Tiuryn","year":"1981"},{"key":"10.1016\/0022-0000(84)90027-8_BIB28","unstructured":"B. A. Trakhtenbrot, J. Y. Halpern, and A. R. Meyer, From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview, in \u201cLogics of Programs, Proceedings\u201d (Clarke and Kozen, Eds.), Lecture Notes in Computer Science, Springer-Verlag, New York\/Berlin, in press."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:51Z","timestamp":1550307111000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900278"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90027-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}