{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:34:48Z","timestamp":1777559688138,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,12,1]],"date-time":"1975-12-01T00:00:00Z","timestamp":186624000000},"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":13743,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1975,12]]},"DOI":"10.1016\/s0022-0000(75)80060-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"392-396","source":"Crossref","is-referenced-by-count":10,"title":["Practical decidability"],"prefix":"10.1016","volume":"11","author":[{"given":"Andrzej","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80060-2_bib1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0021-9045(73)90089-0","article-title":"Interpolation of functions over a measure space and conjectures about memory","volume":"9","author":"Ehrenfeucht","year":"1973","journal-title":"J. Approximation Theory"},{"key":"10.1016\/S0022-0000(75)80060-2_bib2","article-title":"Super-exponential complexity of Presburger arithmetic","author":"Fischer","year":"1974","journal-title":"M.I.T. MAC Technical Memo. 43"},{"key":"10.1016\/S0022-0000(75)80060-2_bib3","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/S0022-0000(75)80060-2_bib4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01694182","article-title":"On Boolean functions and connected sets","volume":"5","author":"McKenzie","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(75)80060-2_bib5","first-page":"A","article-title":"Weak S1S cannot be decided","volume":"19","author":"Meyer","year":"1972","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(75)80060-2_bib6","unstructured":"J. Mycielski, Toward a mathematical theory of memory, to appear."},{"key":"10.1016\/S0022-0000(75)80060-2_bib7","article-title":"The complexity of decision problems in automata theory and logic","author":"Stockmeyer","year":"1974"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:54:42Z","timestamp":1544140482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,12]]}},"alternative-id":["S0022000075800602"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80060-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,12]]}}}