{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:05Z","timestamp":1759638965782},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0168-0072(95)00021-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T16:11:55Z","timestamp":1049731915000},"page":"169-199","source":"Crossref","is-referenced-by-count":11,"title":["Hierarchies in transitive closure logic, stratified Datalog and infinitary logic"],"prefix":"10.1016","volume":"77","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]},{"given":"Gregory L.","family":"McColm","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(95)00021-6_BIB1","series-title":"Proc. 21st ACM Symp. on Theory of Computing","first-page":"113","article-title":"Expressiveness of restricted recursive queries","author":"Afrati","year":"1989"},{"key":"10.1016\/0168-0072(95)00021-6_BIB2","series-title":"Proc. 10th ACM Symp. on Principles of Database Systems","first-page":"113","article-title":"On datalog vs. polynomial time","author":"Afrati","year":"1991"},{"key":"10.1016\/0168-0072(95)00021-6_BIB3","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/2272133","article-title":"On Moschovakis closure ordinals","volume":"42","author":"Barwise","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(95)00021-6_BIB4","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\/0168-0072(95)00021-6_BIB5","unstructured":"U. Bosse, personal commmunication (1992)."},{"key":"10.1016\/0168-0072(95)00021-6_BIB6","series-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science","first-page":"612","article-title":"An optimal lower bound on the number of variables for graph identification","author":"Cai","year":"1989"},{"key":"10.1016\/0168-0072(95)00021-6_BIB7","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\/0168-0072(95)00021-6_BIB8","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\/0168-0072(95)00021-6_BIB9","series-title":"Proc. 9th ACM Symp. Principles of Database Systems","first-page":"404","article-title":"GraphLog: a visual formalism for real life recursion","author":"Consens","year":"1990"},{"key":"10.1016\/0168-0072(95)00021-6_BIB10","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\/0168-0072(95)00021-6_BIB11","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\/0168-0072(95)00021-6_BIB12","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 Grundlagen Math."},{"key":"10.1016\/0168-0072(95)00021-6_BIB13","first-page":"35","article-title":"Sur quelques classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publications Scientifique de l' Universite d' Alger, S\u00e9rie A"},{"key":"10.1016\/0168-0072(95)00021-6_BIB14","series-title":"Proc. 5th Workshop on Computer Science Logic CSL '91","first-page":"149","article-title":"On transitive closure logic","volume":"Vol. 626","author":"Gr\u00e4del","year":"1992"},{"key":"10.1016\/0168-0072(95)00021-6_BIB15","series-title":"Proc. 7th IEEE Conf. on Logic in Computer Science","first-page":"58","article-title":"Deterministic versus nondeterministic transitive closure logic","author":"Gr\u00e4del","year":"1992"},{"key":"10.1016\/0168-0072(95)00021-6_BIB16","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\/0168-0072(95)00021-6_BIB17","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\/0168-0072(95)00021-6_BIB18","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\/0168-0072(95)00021-6_BIB19","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\/0168-0072(95)00021-6_BIB20_1","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\/0168-0072(95)00021-6_BIB20_2","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"347","author":"Immerman","year":"1983"},{"key":"10.1016\/0168-0072(95)00021-6_BIB21","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\/0168-0072(95)00021-6_BIB22","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\/0168-0072(95)00021-6_BIB23","series-title":"Computational Complexity Theory","first-page":"75","article-title":"Descriptive and computational complexity","volume":"Vol. 38","author":"Immerman","year":"1989"},{"key":"10.1016\/0168-0072(95)00021-6_BIB24","first-page":"1073","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kannellakis","year":"1990"},{"key":"10.1016\/0168-0072(95)00021-6_BIB25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.2307\/2271729","article-title":"The diversity of quantifier prefixes","volume":"38","author":"Keisler","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(95)00021-6_BIB26","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\/0168-0072(95)00021-6_BIB27","series-title":"Proc. 9th ACM Symp. on Principles of Database Systems","first-page":"61","article-title":"On the expressive power of datalog: tools and a case study","author":"Kolaitis","year":"1990"},{"key":"10.1016\/0168-0072(95)00021-6_BIB28","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0890-5401(92)90021-7","article-title":"Infinitary logics and 0\u20131 laws","volume":"98","author":"Kolaitis","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0168-0072(95)00021-6_BIB29","series-title":"Proc. 8th ACM Symp. on Principles of Database Systems","first-page":"301","article-title":"Inductive pebble games and the expressive power of datalog","author":"Lakshmanan","year":"1989"},{"key":"10.1016\/0168-0072(95)00021-6_BIB30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0168-0072(90)90043-2","article-title":"Parametrization over inductive relations of a bounded number of variables","volume":"48","author":"McColm","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(95)00021-6_BIB31","unstructured":"G. McColm, Pebble games and the fine structure of fixedpoint logic, submitted."},{"key":"10.1016\/0168-0072(95)00021-6_BIB32","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0168-0072(95)00021-6_BIB33","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":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(95)00021-6_BIB34","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 Informatica"},{"key":"10.1016\/0168-0072(95)00021-6_BIB35","series-title":"Proc. 3rd IEEE Symp. on Logic Programming","first-page":"137","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1986"},{"key":"10.1016\/0168-0072(95)00021-6_BIB36","series-title":"Proc. 14th STOC","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0168-0072(95)00021-6_BIB37","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2307\/2271440","article-title":"Finite partially-ordered quantification","volume":"35","author":"Walkoe","year":"1970","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(95)00021-6_BIB38","article-title":"Query-by-example: operations on the transitive closure","author":"Zloof","year":"1976","journal-title":"IBM Research Report RC5526"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:54:24Z","timestamp":1555059264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007295000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0168007295000216"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(95)00021-6","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}