{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:04:55Z","timestamp":1759147495926},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"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":[[1990,4]]},"DOI":"10.1016\/0022-0000(90)90009-a","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"136-153","source":"Crossref","is-referenced-by-count":22,"title":["First-order spectra with one variable"],"prefix":"10.1016","volume":"40","author":[{"given":"Etienne","family":"Grandjean","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90009-A_BIB1","series-title":"Proceedings, 6th ACM Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0022-0000(90)90009-A_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90009-A_BIB3","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0022-0000(90)90009-A_BIB4","series-title":"16th ACM STOC Symposium","first-page":"409","article-title":"Uniform definability on finite structures with successor","author":"De Rougemont","year":"1984"},{"key":"10.1016\/0022-0000(90)90009-A_BIB5","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"Vol. 7","author":"Fagin","year":"1974"},{"key":"10.1016\/0022-0000(90)90009-A_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Z. Math. Logik. Grundlag. Math."},{"key":"10.1016\/0022-0000(90)90009-A_BIB7","first-page":"105","article-title":"On local and non-local properties","volume":"Vol. 107","author":"Gaifman","year":"1982"},{"key":"10.1016\/0022-0000(90)90009-A_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(90)90009-A_BIB9","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1137\/0213025","article-title":"The Spectra of first-order sentences and computational complexity","volume":"13","author":"Grandjean","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90009-A_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01699468","article-title":"Universal quantifiers and time complexity of random access machines","volume":"18","author":"Grandjean","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(90)90009-A_BIB11","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1137\/0217050","article-title":"A natural NP-complete problem with a nontrivial lower bound","volume":"17","author":"Grandjean","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90009-A_BIB12","series-title":"Computation and Proof Theory","first-page":"175","article-title":"Toward logic tailored for computational complexity","volume":"Vol. 1104","author":"Gurevich","year":"1984"},{"key":"10.1016\/0022-0000(90)90009-A_BIB13_1","series-title":"Technical Report CRL-TR-10-85","article-title":"Logic and the Challenge of Computer Science","author":"Gurevich","year":"1985"},{"key":"10.1016\/0022-0000(90)90009-A_BIB13_2","series-title":"Current Trends in Theoretical Computer Science","first-page":"1","author":"Gurevich","year":"1986"},{"key":"10.1016\/0022-0000(90)90009-A_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0022-0000(81)90039-8","article-title":"Number of Quantifiers is better than number of tape cells","volume":"22","author":"Immerman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90009-A_BIB15_1","series-title":"14th ACM Symposium on Theory of Computing","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982"},{"key":"10.1016\/0022-0000(90)90009-A_BIB15_2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90009-A_BIB16_1","series-title":"15th ACM Symposium on Theory of Computing","first-page":"347","article-title":"Languages which capture complexity classes","author":"Immerman","year":"1983"},{"issue":"No. 4","key":"10.1016\/0022-0000(90)90009-A_BIB16_2","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages which capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90009-A_BIB17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/2272354","article-title":"Turing machines and the spectra of first-order formulas","volume":"39","author":"Jones","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(90)90009-A_BIB18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01786976","article-title":"Complexity classes and theories of finite models","volume":"15","author":"Lynch","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(90)90009-A_BIB19","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/malq.19560021007","article-title":"Concerning a Problem of H. Scholz","volume":"2","author":"Mostowski","year":"1956","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0022-0000(90)90009-A_BIB20","series-title":"24th IEE Symposium on Foundations of Computer Science","first-page":"429","article-title":"On determinism versus non-determinism and related problems","author":"Paul","year":"1983"},{"key":"10.1016\/0022-0000(90)90009-A_BIB21","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/2266243","volume":"17","author":"Scholz","year":"1952","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(90)90009-A_BIB22","series-title":"14th ACM Symposium on Theory of Computing","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0022-0000(90)90009-A_BIB23","series-title":"Computation Theory and Logic","first-page":"20","article-title":"Existential fixed-point logic","volume":"Vol. 270","author":"Blass","year":"1987"},{"key":"10.1016\/0022-0000(90)90009-A_BIB24","series-title":"Techniques et Sciences Informatiques","first-page":"419","article-title":"Calculabilit\u00e9 et bases de donn\u00e9es","author":"De Rougemont","year":"1987"},{"key":"10.1016\/0022-0000(90)90009-A_BIB25","article-title":"A Nontrivial Lower Bound for an NP Problem on Automata","author":"Grandjean","year":"1987","journal-title":"Technical Report, Univ. de Caen, Cahier du LIUC 87-5"},{"key":"10.1016\/0022-0000(90)90009-A_BIB26","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(90)90009-A_BIB27","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/BF00263650","article-title":"Minimal coverings for incompletely specified sequential machines","volume":"22","author":"Reusch","year":"1986","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090009A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090009A?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:55:37Z","timestamp":1550325337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090009A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["002200009090009A"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90009-a","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}