{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:04Z","timestamp":1759638244810},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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":10669,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1984,5]]},"DOI":"10.1016\/0012-365x(84)90166-3","type":"journal-article","created":{"date-parts":[[2004,7,27]],"date-time":"2004-07-27T21:39:26Z","timestamp":1090964366000},"page":"291-302","source":"Crossref","is-referenced-by-count":19,"title":["On the definability of properties of finite graphs"],"prefix":"10.1016","volume":"49","author":[{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(84)90166-3_BIB1","series-title":"Logic and algorithmic International Symposium in honour of E. Specker","first-page":"47","article-title":"Structured vs. general models in computational complexity","author":"Borodin","year":"1982"},{"key":"10.1016\/0012-365X(84)90166-3_BIB2","first-page":"333","article-title":"Structure and complexity of relational queries","author":"Chandra","year":"1980","journal-title":"IEEE FOCS"},{"key":"10.1016\/0012-365X(84)90166-3_BIB3","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0012-365X(84)90166-3_BIB4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","author":"Fagin","year":"1975","journal-title":"Z. Math. Logik"},{"key":"10.1016\/0012-365X(84)90166-3_BIB5","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin","year":"1974"},{"key":"10.1016\/0012-365X(84)90166-3_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","article-title":"The Computational Complexity of Logical Theories","volume":"718","author":"Ferrante","year":"1979","journal-title":"Lecture Notes in Math."},{"key":"10.1016\/0012-365X(84)90166-3_BIB7","first-page":"27","article-title":"Super-exponential complexity of Presburger-arithmetic","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/0012-365X(84)90166-3_BIB8","series-title":"Mechanizing Hypothesis Formation","author":"Hajek","year":"1978"},{"key":"10.1016\/0012-365X(84)90166-3_BIB9","first-page":"384","article-title":"Number of quantifiers is better than number of tape cells","volume":"22","author":"Immerman","year":"1981","journal-title":"JCSS"},{"key":"10.1016\/0012-365X(84)90166-3_BIB10","first-page":"74","article-title":"Upper and lower bounds for first-order expressibility","author":"Immerman","year":"1980","journal-title":"IEEE FOCS"},{"key":"10.1016\/0012-365X(84)90166-3_BIB11","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982","journal-title":"ACM STOC"},{"key":"10.1016\/0012-365X(84)90166-3_BIB12","first-page":"261","article-title":"Application of model theoretic games to discrete linear orders and finite automata","author":"Ladner","year":"1977","journal-title":"Inf. and Cont."},{"key":"10.1016\/0012-365X(84)90166-3_BIB13","unstructured":"L. Lov\u00e1sz, unpublished."},{"key":"10.1016\/0012-365X(84)90166-3_BIB14","unstructured":"L. P\u00f3sa, unpublished."},{"key":"10.1016\/0012-365X(84)90166-3_BIB15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(84)90166-3_BIB16","article-title":"Gr\u00e1f-tulajdons\u00e1gok lok\u00e1lis felismerhet\u00f6s\u00e9g\u00e9r\u00f6l \u00e9s defini\u00e1lhat\u00f3s\u00e1g\u00e1r\u00f3l","author":"Tur\u00e1n","year":"1980"},{"key":"10.1016\/0012-365X(84)90166-3_BIB17","series-title":"Fundamentals of Computing","first-page":"384","article-title":"Cellular graph-automata and second-order definable graph-properties","volume":"117","author":"Tur\u00e1n","year":"1981"},{"key":"10.1016\/0012-365X(84)90166-3_BIB18","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982","journal-title":"ACM STOC"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84901663?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84901663?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T11:53:32Z","timestamp":1549367612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X84901663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["0012365X84901663"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(84)90166-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}