{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:13:44Z","timestamp":1761930824690,"version":"build-2065373602"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029830","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:14:31Z","timestamp":1056579271000},"page":"215-224","source":"Crossref","is-referenced-by-count":24,"title":["The complexity of first-order and monadic second-order logic revisited"],"prefix":"10.1109","author":[{"given":"M.","family":"Frick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Grohe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"137","article-title":"The complexity of relational query languages","author":"vardi","year":"1982","journal-title":"Proceedings of the 14th ACM Symposium on Theory of Computing"},{"journal-title":"The Complexity of Decision Problems in Automata Theory","year":"1974","author":"stockmeyer","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/318593.318622"},{"key":"14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S0960129500070079","article-title":"Linear time computable problems and first-order descriptions","volume":"6","author":"seese","year":"1996","journal-title":"Mathematical Structures in Computer Science"},{"journal-title":"Tense logic and the theory of linear order","year":"1968","author":"kamp","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/343369.343376"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00034-Z"},{"key":"10","first-page":"132","article-title":"Model-theoretic methods in the study of elementary logic","author":"hanf","year":"1965","journal-title":"Model Theory"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00097-3"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792228228"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171496","author":"cutland","year":"1980","journal-title":"Computability"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2355-7"}],"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\/01029830.pdf?arnumber=1029830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:31:28Z","timestamp":1585009888000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029830","relation":{},"subject":[]}}