{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:00:42Z","timestamp":1649055642279},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/s0019-9958(83)80031-x","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T11:12:14Z","timestamp":1115118734000},"page":"94-107","source":"Crossref","is-referenced-by-count":3,"title":["Regular dynamic logic is not interpretable in deterministic context-free dynamic logic"],"prefix":"10.1016","volume":"59","author":[{"given":"A.P.","family":"Stolboushkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(83)80031-X_bib1","series-title":"The Burnside Problem and Identities in Groups","author":"Adian","year":"1979"},{"key":"10.1016\/S0019-9958(83)80031-X_bib2","series-title":"Proceedings, Foundations of Computation Theory","article-title":"Deterministic dynamic logic of recursive programs is weaker than dynamic logic","author":"Berman","year":"1983"},{"key":"10.1016\/S0019-9958(83)80031-X_bib3","series-title":"First-Order Dynamic Logic","author":"Harel","year":"1979"},{"key":"10.1016\/S0019-9958(83)80031-X_bib4","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/S0019-9958(83)80031-X_bib5","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. Contr."},{"issue":"No. 3","key":"10.1016\/S0019-9958(83)80031-X_bib6","first-page":"184","article-title":"Hierarchies of Program Logics","volume":"24","author":"Taitslin","year":"1983","journal-title":"Siberian Math. J."},{"key":"10.1016\/S0019-9958(83)80031-X_bib7","series-title":"Proceedings, Foundations of Computation Theory","article-title":"Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs","author":"Urzyczyn","year":"1983"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588380031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588380031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:55:56Z","timestamp":1548532556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999588380031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["S001999588380031X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80031-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}