{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:15:28Z","timestamp":1737522928749,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"},{"type":"electronic","value":"9783540755609"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75560-9_11","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T05:36:46Z","timestamp":1191649006000},"page":"123-137","source":"Crossref","is-referenced-by-count":2,"title":["Completeness and Decidability in Sequence Logic"],"prefix":"10.1007","author":[{"given":"Marc","family":"Bezem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tore","family":"Langholm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Walicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"key":"11_CR2","first-page":"9","volume":"102","author":"D.J. Brown","year":"1973","unstructured":"Brown, D.J., Suszko, R.: Abstract logics. Dissertationes Mathematicae\u00a0102, 9\u201342 (1973)","journal-title":"Dissertationes Mathematicae"},{"key":"11_CR3","series-title":"LNM","volume-title":"The Monadic Second-Order Theory of All Countable Ordinals","author":"J.R. B\u00fcchi","year":"1988","unstructured":"B\u00fcchi, J.R., Siefkes, D.: VDM 1988. LNM, vol.\u00a0328. Springer, Heidelberg (1988)"},{"key":"11_CR4","unstructured":"Demri, S., Rabinovich, A.: The complexity of temporal logic with until and since over ordinals (submitted to LPAR 2007)"},{"key":"11_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"issue":"9","key":"11_CR6","first-page":"1137","volume":"9","author":"V. Goranko","year":"2003","unstructured":"Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood temporal logics. Journal of Universal Computer Science\u00a09(9), 1137\u20131167 (2003)","journal-title":"Journal of Universal Computer Science"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"J. Halpern","year":"1991","unstructured":"Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM\u00a038(4), 935\u2013962 (1991)","journal-title":"Journal of the ACM"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the ACM"},{"key":"11_CR9","unstructured":"Szajnkenig, W.: Sequence Logic. PhD thesis, Department of Informatics, University of Bergen, forthcoming"},{"key":"11_CR10","volume-title":"Logic, Semantics, Metamathematics","author":"A. Tarski","year":"1956","unstructured":"Tarski, A.: Logic, Semantics, Metamathematics. Oxford University Press, New York (1956)"},{"key":"11_CR11","unstructured":"Walicki, M., Bezem, M.A., Szajnkenig, W.: A strongly complete logic of dense time intervals. In: Alechina, N., \u00c5gotnes, T. (eds.) Proceedings of the Workshop on Logics for Resource-Bounded Agents, ESSLLI, Malaga, Spain (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:23:11Z","timestamp":1737462191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755586","9783540755609"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}