{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:34Z","timestamp":1761611074481},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0304-3975(90)90161-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"47-60","source":"Crossref","is-referenced-by-count":19,"title":["On the interpretability of arithmetic in temporal logic"],"prefix":"10.1016","volume":"73","author":[{"given":"Fred","family":"Kr\u00f6ger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90161-A_BIB1","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(90)90161-A_BIB2","series-title":"EATCS Monographs in Computer Science","article-title":"Temporal Logic of Programs","author":"Kr\u00f6ger","year":"1987"},{"key":"10.1016\/0304-3975(90)90161-A_BIB3","first-page":"559","article-title":"Abstract modules: Combining algebraic and temporal logic specification means","volume":"6","author":"Kr\u00f6ger","year":"1987","journal-title":"Techniques Sci. Inform."},{"key":"10.1016\/0304-3975(90)90161-A_BIB4","first-page":"510","article-title":"Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends","volume":"224","author":"Pnueli","year":"1986"},{"key":"10.1016\/0304-3975(90)90161-A_BIB5","series-title":"Diploma thesis","article-title":"Petri-Netze und Temporale Logik","author":"Sch\u00fctz","year":"1985"},{"key":"10.1016\/0304-3975(90)90161-A_BIB6","series-title":"Mathematical Logic","author":"Schoenfield","year":"1967"},{"key":"10.1016\/0304-3975(90)90161-A_BIB7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(86)90157-X","article-title":"Concerning the semantic consequence relation in first-order temporal logic","volume":"47","author":"Szalas","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90161-A_BIB8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(88)90045-X","article-title":"Incompleteness of first-order temporal logic with until","volume":"57","author":"Szalas","year":"1988","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090161A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090161A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:26Z","timestamp":1555077386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090161A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["030439759090161A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90161-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}