{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:16Z","timestamp":1761596776844},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00151-7","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"129-152","source":"Crossref","is-referenced-by-count":25,"title":["Guarded fixed point logics and the monadic theory of countable trees"],"prefix":"10.1016","volume":"288","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00151-7_BIB1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1004275029985","article-title":"Modal languages and bounded fragments of predicate logic","volume":"27","author":"Andr\u00e9ka","year":"1998","journal-title":"J. Philos. Logic"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB2","doi-asserted-by":"crossref","unstructured":"J. van Benthem, Modal correspondence theory, Ph.D. Thesis, University of Amsterdam, 1976.","DOI":"10.2307\/2272228"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB3","unstructured":"J. van Benthem, Dynamic bits and pieces, ILLC Research Report, University of Amsterdam, 1997."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB4","series-title":"Modal Logic","author":"Blackburn","year":"2001"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB5","doi-asserted-by":"crossref","unstructured":"A. Emerson, C. Jutla, The complexity of tree automata and logics of programs, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 328\u2013337.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB6","series-title":"Models, Algebras, and Proofs","first-page":"67","article-title":"On the (infinite) model theory of fixed-point logics","volume":"Vol. 2003","author":"Flum","year":"1999"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB7","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, H. de Nivelle, A superposition decision procedure for the guarded fragment with equality, in: Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, pp. 295\u2013305.","DOI":"10.1109\/LICS.1999.782624"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB8","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, pp. 24\u201334.","DOI":"10.1109\/LICS.1999.782582"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB9","doi-asserted-by":"crossref","unstructured":"G. Gottlob, E. Gr\u00e4del, H. Veith, Datalog lite: a deductive query language with linear time model checking, ACM Trans. Comput. Logic, to appear.","DOI":"10.1145\/504077.504079"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB10","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.2307\/2586808","article-title":"On the restraining power of guards","volume":"64","author":"Gr\u00e4del","year":"1999","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB11","first-page":"90","article-title":"Why are modal logics so robustly decidable?","volume":"68","author":"Gr\u00e4del","year":"1999","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB12","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, C. Hirsch, M. Otto, Back and forth between guarded and modal logics, in: Proc. 15th IEEE Symp. on Logic in Computer Science, 2000, pp. 217\u2013228.","DOI":"10.1109\/LICS.2000.855771"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB13","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, I. Walukiewicz, Guarded fixed point logic, in: Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, pp. 45\u201354.","DOI":"10.1109\/LICS.1999.782585"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB14","series-title":"Model Theory","author":"Hodges","year":"1993"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB15","unstructured":"I. Hodkinson, Loosely guarded fragment of first-order logic has the finite model property, preprint, 2000."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB16","unstructured":"E. Hoogland, M. Marx, Interpolation in guarded fragments, preprint."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB17","doi-asserted-by":"crossref","unstructured":"E. Hoogland, M. Marx, M. Otto, Beth definability for the guraded fragment, in: Proc. LPAR\u201999, Lecture Notes in Artificial Intelligence, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-48242-3_17"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB18","doi-asserted-by":"crossref","unstructured":"D. Janin, I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, in: Proc. 7th Internat. Conf. on Concurrency Theory CONCUR\u201996, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 263\u2013277.","DOI":"10.1007\/3-540-61604-7_60"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB19","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","article-title":"The computational complexity of provability in systems of propositional modal logic","volume":"6","author":"Ladner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB20","unstructured":"M. Marx, Tolerance logic, Tech. Rep. IR-469, Faculteit der Exacte Wetenschappen, Vrije Universiteit Amsterdam, 1999."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB21","unstructured":"B. Poizat, Cours de th\u00e9orie des mod\u00e8les, Nur al-Mantiq wal-Ma'rifah, 1985."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB22","series-title":"First Steps in Modal Logic","author":"Popcorn","year":"1994"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB23","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. AMS"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB24","series-title":"Surveys in Combinatorics","first-page":"87","article-title":"Tree width and tangles: a new connectivity measure and some applications","author":"Reed","year":"1997"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB25","unstructured":"E. Spaan, Complexity of modal logics, Ph.D. Thesis, University of Amsterdam, Institute for Logic, Language and Computation, 1993."},{"key":"10.1016\/S0304-3975(01)00151-7_BIB26","series-title":"Descriptive Complexity and Finite Models","first-page":"149","article-title":"Why is modal logic so robustly decidable?","volume":"Vol. 31","author":"Vardi","year":"1997"},{"key":"10.1016\/S0304-3975(01)00151-7_BIB27","doi-asserted-by":"crossref","unstructured":"M. Vardi, Reasoning about the past with two-way automata, in: Automata, Languages and Programming ICALP 98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 628\u2013641.","DOI":"10.1007\/BFb0055090"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T09:16:01Z","timestamp":1583658961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501001517"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00151-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}