{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T06:29:50Z","timestamp":1775802590568,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"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":11308,"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":[[1982,8]]},"DOI":"10.1016\/0022-0000(82)90011-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"76-98","source":"Crossref","is-referenced-by-count":172,"title":["Upper and lower bounds for first order expressibility"],"prefix":"10.1016","volume":"25","author":[{"given":"Neil","family":"Immerman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90011-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(82)90011-3_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190030305","article-title":"Properties of almost all graphs and complexes","volume":"3","author":"Blass","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0022-0000(82)90011-3_BIB3","series-title":"Proc. 17th FOGS","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(82)90011-3_BIB4","author":"Compton","year":"1980"},{"key":"10.1016\/0022-0000(82)90011-3_BIB5","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":"Fund. Math."},{"key":"10.1016\/0022-0000(82)90011-3_BIB6","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/0022-0000(82)90011-3_BIB7","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","author":"Fagin","year":"1974"},{"issue":"No. 1","key":"10.1016\/0022-0000(82)90011-3_BIB8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbol Logic"},{"key":"10.1016\/0022-0000(82)90011-3_BIB9","series-title":"Complexity of Computation","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","author":"Fischer","year":"1974"},{"key":"10.1016\/0022-0000(82)90011-3_BIB10","article-title":"Sur les classifications des systems de relations","volume":"1","author":"Fraisse","year":"1954","journal-title":"Publ. Sci. Univ. Alger"},{"key":"10.1016\/0022-0000(82)90011-3_BIB11","series-title":"Proc. 19th FOCS","first-page":"65","article-title":"One-way Log tape reductions","author":"Hartmanis","year":"1978"},{"key":"10.1016\/0022-0000(82)90011-3_BIB12","series-title":"Proc. 20th FOCS","first-page":"33747","article-title":"Length of predicate calculus formulas as a new complexity measure","author":"Immerman","year":"1979"},{"key":"10.1016\/0022-0000(82)90011-3_BIB13","article-title":"First Order Expressibility as a New Complexity Measure","author":"Immerman","year":"1980"},{"key":"10.1016\/0022-0000(82)90011-3_BIB14","series-title":"Proc. 21st FOCS","first-page":"74","article-title":"Upper and lower bounds for first order expressibility","author":"Immerman","year":"1980"},{"key":"10.1016\/0022-0000(82)90011-3_BIB15","doi-asserted-by":"crossref","unstructured":"N. Immerman, Number of quantifiers is better than number of tape cells, J. Comput. System Sci., in press.","DOI":"10.1016\/0022-0000(81)90039-8"},{"key":"10.1016\/0022-0000(82)90011-3_BIB16","series-title":"Proc. 17th FOCS","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0022-0000(82)90011-3_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0003-4843(80)90014-5","article-title":"Almost sure theories","volume":"18","author":"Lynch","year":"1980","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0022-0000(82)90011-3_BIB18","series-title":"Proc. 11th SIGACT","first-page":"288","article-title":"Universal games of incomplete information","author":"Reif","year":"1979"},{"key":"10.1016\/0022-0000(82)90011-3_BIB19","series-title":"Proc. 11th SIGACT","first-page":"352","article-title":"Tree-size bounded alternation","author":"Ruzzo","year":"1979"},{"key":"10.1016\/0022-0000(82)90011-3_BIB20","series-title":"Proc. 20th FOCS","first-page":"312","article-title":"On uniform circuit complexity","author":"Ruzzo","year":"1979"},{"key":"10.1016\/0022-0000(82)90011-3_BIB21","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0022-0000(73)80031-5","article-title":"Maze recognizing automata and nondeterministic tape complexity","volume":"7","author":"Savitch","year":"1973","journal-title":"J. Comput. System Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(82)90011-3_BIB22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic CFL's","author":"Sudborough","year":"1978","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:11Z","timestamp":1550325011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0022000082900113"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90011-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}