{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:54:31Z","timestamp":1648637671059},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0890-5401(92)90077-s","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"103-122","source":"Crossref","is-referenced-by-count":1,"title":["A Modal Logic for Cyclic Repeating"],"prefix":"10.1016","volume":"101","author":[{"given":"Dimiter","family":"Vakarelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90077-S_BIB1","series-title":"Proceedings, MFCS'84","first-page":"573","article-title":"Propositional dynamic logic with strong loop predicate","volume":"Vol. 176","author":"Danecki","year":"1984"},{"key":"10.1016\/0890-5401(92)90077-S_BIB2","series-title":"Proceedings, Fifth Symposium on Computation Theory, Zaborov, Poland, December 84","first-page":"34","article-title":"Nondeterministic Propositional Dynamic Logic with intersection is decidable","volume":"Vol. 208","author":"Danecki","year":"1985"},{"key":"10.1016\/0890-5401(92)90077-S_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(88)90126-0","article-title":"Determinism and looping in combinatory PDL","volume":"61","author":"Gargov","year":"1988","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0890-5401(92)90077-S_BIB4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF00370431","article-title":"An algebraic study of well-foundedness","volume":"XLIV","author":"Goldblatt","year":"1985","journal-title":"Studia Logica"},{"key":"10.1016\/0890-5401(92)90077-S_BIB5","series-title":"Proceedings, FCT'83","first-page":"177","article-title":"Recurring dominoes: Making the highly undecidable highly understandable","volume":"Vol. 158","author":"Harel","year":"1983"},{"key":"10.1016\/0890-5401(92)90077-S_BIB6","author":"Hughes","year":"1984"},{"key":"10.1016\/0890-5401(92)90077-S_BIB7","series-title":"Mathematical Logic, Proceedings of the Summer School and Conference on Mathematical Logic, dedicated to the Ninetieth Anniversary of Arend Heyting, September 88, Chajka near Varna","article-title":"Completeness of propositional dynamic logic with infinite repeating","author":"Sakalauskaite","year":"1980"},{"key":"10.1016\/0890-5401(92)90077-S_BIB8","author":"Segerberg","year":"1971","journal-title":"An Essay in Classical Modal Logic"},{"key":"10.1016\/0890-5401(92)90077-S_BIB9","series-title":"Universal Algebra and Applications","first-page":"31","article-title":"A completeness theorem in the propositional modal logic of programs","volume":"Vol. 9","author":"Segerberg","year":"1982"},{"key":"10.1016\/0890-5401(92)90077-S_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse is elementary decidable","volume":"54","author":"Streett","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(92)90077-S_BIB11","author":"Vakarelov","year":"1988","journal-title":"Inductive modal logics"},{"key":"10.1016\/0890-5401(92)90077-S_BIB12","series-title":"Mathematical Logic, Proceedings of the Summer School and Conference on Mathematical Logic, Dedicated to the Ninetieth Anniversary of Arend Heyting, September 88, Chajka near Varna","article-title":"Modal characterization of the classes of finite and infinite quasiordered sets","author":"Vakarelov","year":"1990"},{"key":"10.1016\/0890-5401(92)90077-S_BIB13","first-page":"167","article-title":"Correspondence theory","volume":"Vol. II","author":"van Benthem","year":"1984"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290077S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290077S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:26:20Z","timestamp":1548879980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290077S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["089054019290077S"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90077-s","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}