{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T18:16:56Z","timestamp":1792865816149,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425540","type":"print"},{"value":"9783540448020","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_20","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"277-291","source":"Crossref","is-referenced-by-count":5,"title":["Inflationary Fixed Points in Modal Logic"],"prefix":"10.1007","author":[{"given":"A.","family":"Dawar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Gr\u00e4del","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Kreutzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"20_CR1","unstructured":"A. Arnold and D. Niwinski. Rudiments of \u03bc-calculus, North-Holland, 2001."},{"key":"20_CR2","volume-title":"Modal Logic and Classical Logic","author":"J. Benthem van","year":"1983","unstructured":"J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napoli, 1983."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. B\u00fcchi","year":"1960","unstructured":"J. B\u00fcchi. Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, 6:66\u201392, 1960.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"20_CR4","unstructured":"A. Dawar. Feasible Computation Through Model Theory. PhD thesis, University of Pennsylvania, 1993."},{"key":"20_CR5","unstructured":"A. Dawar, E. Gr\u00e4del, and S. Kreutzer. Inflationary Fixed Points in Modal Logics. See \u201c http:\/\/www.cl.cam.ac.uk\/users\/ad260\/pubs.html \u201d or \u201chttp:\/\/www-mgi.informatik.rwth-aachen.de\/Publications\/\u201d."},{"key":"20_CR6","unstructured":"A. Dawar and Y. Gurevich. Fixed point logics. In preparation."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.1995.1166","volume":"123","author":"A. Dawar","year":"1995","unstructured":"A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. Information and Computation, 123:172\u2013184, 1995.","journal-title":"Information and Computation"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1995.1084","volume":"119","author":"A. Dawar","year":"1994","unstructured":"A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119:160\u2013175, 1994.","journal-title":"Information and Computation"},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"10th Annual Conference on Computer Science Logic CSL 96. Selected papers","author":"S. Dziembowski","year":"1996","unstructured":"S. Dziembowski. Bounded-variable fixpoint queries are PSPACE-complete. In 10th Annual Conference on Computer Science Logic CSL 96. Selected papers, volume 1258 of Lecture Notes in Computer Science, pages 89\u2013105. Springer, 1996."},{"key":"20_CR10","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00308-9","volume":"224","author":"E. Gr\u00e4del","year":"1999","unstructured":"E. Gr\u00e4del and M. Otto. On logics with two variables. Theoretical Computer Science, 224:73\u2013113, 1999.","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265\u2013280, 1986.","journal-title":"Annals of Pure and Applied Logic"},{"key":"20_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"Proceedings of 7th International Conference on Concurrency Theory CONCUR\u2019 96","author":"D. Janin","year":"1996","unstructured":"D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proceedings of 7th International Conference on Concurrency Theory CONCUR\u2019 96, number 1119 in Lecture Notes in Computer Science, pages 263\u2013277. Springer-Verlag, 1996."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzinski","year":"1998","unstructured":"M. Jurdzinski. Deciding the winner in parity games is in UP \u2229 Co-UP. Information Processing Letters, 68:119\u2013124, 1998.","journal-title":"Information Processing Letters"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00314-4","volume":"224","author":"M. Otto","year":"1999","unstructured":"M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. The-oretical Computer Science, 224:237\u2013265, 1999.","journal-title":"The-oretical Computer Science"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1006\/jcss.1996.0046","volume":"53","author":"J. Shallit","year":"1996","unstructured":"J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53:10\u201325, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"M. Vardi. On the complexity of bounded-variable queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 266\u2013267, 1995.","DOI":"10.1145\/212433.212474"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:21:10Z","timestamp":1556464870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}