{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T23:30:54Z","timestamp":1673307054530},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0020-0190(90)90051-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"235-238","source":"Crossref","is-referenced-by-count":4,"title":["Simple interpretations among complicated theories"],"prefix":"10.1016","volume":"35","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90051-X_BIB1","doi-asserted-by":"crossref","unstructured":"K. Compton and C.W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(90)90080-L"},{"key":"10.1016\/0020-0190(90)90051-X_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/800119.803895","article-title":"Structure of complexity in the weak monadic second-order theories of the natural numbers","author":"Robertson","year":"1974","journal-title":"Proc. 6th Ann. ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90051-X_BIB3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logics","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90051-X_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata with applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90051-X_BIB5","article-title":"The computational complexity of prefix classes of logical theories","author":"Streid","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090051X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090051X?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:20:49Z","timestamp":1555075249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090051X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["002001909090051X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90051-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}