{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:13:51Z","timestamp":1761930831688,"version":"build-2065373602"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029848","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:14:31Z","timestamp":1056579271000},"page":"403-410","source":"Crossref","is-referenced-by-count":10,"title":["Expressive equivalence of least and inflationary fixed-point logic"],"prefix":"10.1109","author":[{"given":"S.","family":"Kreutzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"137","article-title":"The complexity of relational query languages","author":"vardi","year":"1982","journal-title":"Proceedings of the 14th ACM Symposium on the Theory of Computing"},{"key":"11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4064\/fm-82-1-39-83","article-title":"On non-monotone inductive definability","volume":"82","author":"moschovakis","year":"1974","journal-title":"Fundamenta Mathematica"},{"key":"12","first-page":"464","article-title":"On fixed point clones","volume":"226","author":"niwin?ski","year":"1986","journal-title":"LNCS"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44802-0_20"},{"key":"2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","article-title":"The model ?-calculus alternation hierarchy is strict","volume":"195","author":"bradfield","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"1","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/S0049-237X(08)71120-0","article-title":"An introduction to inductive definitions","author":"aczel","year":"1977","journal-title":"Handbook of Mathematical Logic Volume 90 of Studies in Logic"},{"journal-title":"Elementary Induction on Abstract Structures","year":"1974","author":"moschovakis","key":"10"},{"key":"7","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":"Annals of Pure and Applied Logic"},{"key":"6","first-page":"267","article-title":"Efficient model checking in fragments of the propositional mu-calculus","author":"emerson","year":"1986","journal-title":"Proc on the First Symp on Logic in Computer Science (LICS)"},{"journal-title":"Finite Model Theory","year":"1999","author":"ebbinghaus","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1182353853"},{"journal-title":"Proc 14th Ann ACM Symp on Theory of Computing","first-page":"147","year":"1982","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029848.pdf?arnumber=1029848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T23:31:04Z","timestamp":1519515064000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029848\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029848","relation":{},"subject":[]}}