{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:05:50Z","timestamp":1762351550833},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"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":5099,"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":[[1999,8]]},"DOI":"10.1016\/s0304-3975(98)00314-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"237-265","source":"Crossref","is-referenced-by-count":31,"title":["Bisimulation-invariant PTIME and higher-dimensional \u03bc-calculus"],"prefix":"10.1016","volume":"224","author":[{"given":"Martin","family":"Otto","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00314-4_BIB1","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"209","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB2","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/BF03180566","article-title":"Deciding bisimilarity is P-complete","volume":"4","author":"Balcazar","year":"1992","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB3","unstructured":"J. Barwise, J. van Benthem, Interpolation, preservation, and pebble games, to appear in J. Symbolic Logic."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB4","article-title":"Vicious Circles","volume":"vol. 60","author":"Barwise","year":"1996","journal-title":"CSLI Lecture Notes Series"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1023\/A:1004268613379","article-title":"Modal correspondence for models","volume":"26","author":"Barwise","year":"1998","journal-title":"J. Philos. Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB6","article-title":"Modal correspondence theory","author":"van Benthem","year":"1976"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB7","series-title":"Modal Logic and Classical Logic","author":"van Benthem","year":"1985"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB8","article-title":"The undecidability of the domino problem","volume":"vol. 66","author":"Berger","year":"1966","journal-title":"Memors of the AMS"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB9","article-title":"The classical decision problem","author":"B\u00f6rger","year":"1997","journal-title":"Perspect. Math. Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB10","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\/S0304-3975(98)00314-4_BIB11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1995.1084","article-title":"Infinitary logic and inductive definability over finite structures","volume":"119","author":"Dawar","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03182-7_6","article-title":"Finite model theory","author":"Ebbinghaus","year":"1995","journal-title":"Perspect. Math. Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB13","series-title":"Handbook of Theoretical Computer Science","first-page":"995","article-title":"Temporal and modal logic","volume":"vol. B","author":"Emerson","year":"1990"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB14","series-title":"Selected Papers of CSL '92","first-page":"231","article-title":"Inductive definability with counting on finite structures","volume":"vol. 702","author":"Gr\u00e4del","year":"1993"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB15_1","article-title":"Undecidability results on logics with two variables","author":"Gr\u00e4del","year":"1998","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB15_2","series-title":"Proc. 14th Symp. on Theoretical Aspects of Computer Science","first-page":"249","volume":"vol. 1200","author":"Gr\u00e4del","year":"1997"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB16","series-title":"Current Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of Computer Science","author":"Gurevich","year":"1988"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00971620","article-title":"Remarks on Berger's paper on the domino problem","volume":"13","author":"Gurevich","year":"1972","journal-title":"Siberian Math. J."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB18","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\/S0304-3975(98)00314-4_BIB19","first-page":"51","article-title":"Recurring dominoes: making the highly undecidable highly understandable","volume":"24","author":"Harel","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","article-title":"Effective transformations on infinite trees, with applications to high undecidability, dominoes and fairness","volume":"33","author":"Harel","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00314-4_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":"Information and Control"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB22","series-title":"Proc. 7th Internat. Conf. on Concurrency Theory, Concur '96","first-page":"263","article-title":"On the expressive completeness of the propositional mu-calculus with respect to monadic second-order logic","volume":"vol. 1119","author":"Janin","year":"1996"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB23","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00370554","article-title":"A finite model theorem for the propositional \u03bc-calculus","volume":"47","author":"Kozen","year":"1987","journal-title":"Studia Logica"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB25","series-title":"Logics of Programs","first-page":"313","article-title":"A decision procedure for the propositional \u03bc-calculus","volume":"vol. 164","author":"Kozen","year":"1984"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB26","article-title":"A Calculus of Communicating Systems","volume":"vol. 2","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.2307\/2275602","article-title":"The expressive power of fixed-point logic with counting","volume":"61","author":"Otto","year":"1996","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0168-0072(96)00047-4","article-title":"Canonization for two variables and puzzles on the square","volume":"85","author":"Otto","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB29","article-title":"Bounded Variable Logics and Counting \u2014 A Study in Finite Models","volume":"vol. 9","author":"Otto","year":"1997"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB30","doi-asserted-by":"crossref","unstructured":"M. Otto, Bounded variable logics: two, three, and more, Arch. Math. Logic, to appear.","DOI":"10.1007\/s001530050127"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB31","series-title":"Proc. 5th GI-Conf. on Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB32","series-title":"Proc. 4th Symp. on Logical Foundations of Computer Science","first-page":"178","article-title":"On linear oerdering of strongly extensional finitely-branching graphs and nonwell-founded sets","volume":"vol. 1234","author":"Sazonov","year":"1997"},{"key":"10.1016\/S0304-3975(98)00314-4_BIB33","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","article-title":"An automata theoretic decision procedure for the propositional \u03bc-calculus","volume":"81","author":"Streett","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00314-4_BIB34","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003144?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003144?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:21:37Z","timestamp":1555406497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397598003144"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00314-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}