{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:16:11Z","timestamp":1774620971690,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0304-3975(92)90149-a","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"35-57","source":"Crossref","is-referenced-by-count":67,"title":["Capturing complexity classes by fragments of second-order logic"],"prefix":"10.1016","volume":"101","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90149-A_BIB1","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991","journal-title":"Proc. 23rd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90149-A_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Apsvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90149-A_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(86)90040-0","article-title":"Henkin quantifiers and complete problems","volume":"32","author":"Blass","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(92)90149-A_BIB4","first-page":"116","article-title":"Two applications of complementation via inductive counting","author":"Borodin","year":"1988","journal-title":"Proc. 3rd IEEE Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(92)90149-A_BIB5","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/SFCS.1989.63543","article-title":"An optimal lower bound on the number of variables for graph identification","author":"Cai","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(92)90149-A_BIB6","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\/0304-3975(92)90149-A_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90149-A_BIB8","series-title":"Computation Theory and Logic","first-page":"101","article-title":"Skolem normal forms concerning the least fixed point","volume":"Vol. 270","author":"Dahlhaus","year":"1987"},{"key":"10.1016\/0304-3975(92)90149-A_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90149-A_BIB10","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin","year":"1974","journal-title":"SIAM-AMS Proc."},{"key":"10.1016\/0304-3975(92)90149-A_BIB11","series-title":"Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1988"},{"key":"10.1016\/0304-3975(92)90149-A_BIB12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed point extensions of first order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(92)90149-A_BIB13","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\/0304-3975(92)90149-A_BIB14","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","article-title":"Upper and lower bounds for first-order expressibility","volume":"25","author":"Immerman","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90149-A_BIB15","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\/0304-3975(92)90149-A_BIB16","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90149-A_BIB17","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/PSCT.1987.10319271","article-title":"Expressibility as a complexity measure: results and directions","author":"Immerman","year":"1987","journal-title":"Proc. 2nd Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(92)90149-A_BIB18","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90149-A_BIB19","series-title":"Proc. AMS Symposia in Appl. Math","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/038\/1020810","article-title":"Descriptive and computational complexity","volume":"Vol. 38","author":"Immerman","year":"1989"},{"key":"10.1016\/0304-3975(92)90149-A_BIB20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","article-title":"Expressibility and parallel complexity","volume":"18","author":"Immerman","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90149-A_BIB21","series-title":"Complexity Theory Retrospective","first-page":"59","article-title":"Describing graphs: a first order approach to graph canonization","author":"Immerman","year":"1990"},{"key":"10.1016\/0304-3975(92)90149-A_BIB22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","article-title":"Unification as a complexity measure for logic programming","volume":"4","author":"Itai","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90149-A_BIB23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90149-A_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic logspace","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90149-A_BIB25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","article-title":"The expressive power of stratified logic programs","volume":"90","author":"Kolaitis","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(92)90149-A_BIB26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/malq.19670130104","article-title":"The decision problem for a class of first-order formulas in which all disjunctions are binary","volume":"13","author":"Krom","year":"1967","journal-title":"Z. Math. Logik Grundlagen der Mathematik"},{"key":"10.1016\/0304-3975(92)90149-A_BIB27","doi-asserted-by":"crossref","unstructured":"R. Ladner, The circuit value problem is logspace complete for P, SIGACT News 7 18\u201320.","DOI":"10.1145\/990518.990519"},{"key":"10.1016\/0304-3975(92)90149-A_BIB28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0022-0000(89)90019-6","article-title":"Descriptive characterizations of computational complexity","volume":"39","author":"Leivant","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90149-A_BIB29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","article-title":"Symmetric space bounded computation","volume":"19","author":"Lewis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90149-A_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90149-A_BIB31","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(92)90149-A_BIB32","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290149A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290149A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T12:14:25Z","timestamp":1704197665000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290149A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["030439759290149A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90149-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}