{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:49:26Z","timestamp":1676980166756},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"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":[[2003,12]]},"DOI":"10.1016\/s0890-5401(03)00163-9","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"196-208","source":"Crossref","is-referenced-by-count":10,"title":["Future temporal logic needs infinitely many modalities"],"prefix":"10.1016","volume":"187","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00163-9_BIB1","series-title":"Real Time: Theory and Practice","first-page":"74","article-title":"Logics and models of real time: a survey","volume":"vol. 600","author":"Alur","year":"1992"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB2","unstructured":"D. Beauquier, A. Rabinovich, Monadic logic of order over naturals has no finite base, J. Logic Computations"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theories","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"10.1016\/S0890-5401(03)00163-9_BIB4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u2018Sometimes\u2019 and \u2018not never\u2019 revisited: on branching versus linear time temporal logics","volume":"33","author":"Emerson","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB5","series-title":"Temporal Logic","author":"Gabbay","year":"1994"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB6","doi-asserted-by":"crossref","unstructured":"D. Gabbay, A. Pnueli, S. Shelah, J. Stavi. On the temporal analysis of fairness, in: The 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, 1980, pp. 163\u2013173","DOI":"10.1145\/567446.567462"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB7","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, It\u2019s about time: real-time logics reviewed, in: Concur 98, Lecture Notes in Computer Science, vol. 1466, 1998","DOI":"10.1007\/BFb0055640"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB8","series-title":"Computer Science Logic 1999","first-page":"172","article-title":"Quantitative temporal logic","volume":"vol. 1683","author":"Hirshfeld","year":"1999"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB9","unstructured":"H.W. Kamp, Tense logic and the theory of linear order, Ph.D. Thesis, University of California, Los Angeles, 1968"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB10","series-title":"Proc. IEEE 18th Annu. Symp. on Found. Comput. Sci.","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB11","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0890-5401(03)00163-9_BIB12","series-title":"Proc. 13th Int. Conf. on Concurrency Theory, Brno, Czech Republic, August 2002","first-page":"57","article-title":"Expressive power of temporal logics","volume":"vol. 2421","author":"Rabinovich","year":"2002"},{"key":"10.1016\/S0890-5401(03)00163-9_BIB13","series-title":"Proc. 25th Int. Symp. Math. Found. Comp. Sci. (MFCS\u20192000), Bratislava, Slovakia, August 2000","first-page":"629","article-title":"Why so many temporal logics climb up the trees?","volume":"vol. 1893","author":"Rabinovich","year":"2000"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001639?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001639?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:28:32Z","timestamp":1552609712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103001639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0890540103001639"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00163-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}