{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:47:13Z","timestamp":1694623633620},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"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":2968,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1016\/j.tcs.2004.10.040","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T20:22:48Z","timestamp":1103142168000},"page":"64-95","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["An axiomatization of bisimulation quantifiers via the \u03bc<\/mml:mi><\/mml:math>-calculus"],"prefix":"10.1016","volume":"338","author":[{"given":"Giovanna","family":"D\u2019Agostino","sequence":"first","affiliation":[]},{"given":"Giacomo","family":"Lenzi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2004.10.040_bib1","doi-asserted-by":"crossref","first-page":"310","DOI":"10.2307\/2586539","article-title":"Logical questions concerning the \u03bc-calculus","volume":"65","author":"D\u2019Agostino","year":"2000","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2004.10.040_bib2","unstructured":"G. D\u2019Agostino, G. Lenzi, On Modal \u03bc-Calculus with Explicit Interpolants, ILLC Prepublication Series, PP-2002-17."},{"key":"10.1016\/j.tcs.2004.10.040_bib3","doi-asserted-by":"crossref","first-page":"911","DOI":"10.2307\/2275765","article-title":"A sheaf representation and duality for finitely presented Heyting algebras","volume":"60","author":"Ghilardi","year":"1995","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2004.10.040_bib4","unstructured":"M. Hollenberg, Logic and bisimulation, Ph.D. Thesis, University of Utrecht, Vol. XXIV, Zeno Institute of Philosophy, 1998."},{"key":"10.1016\/j.tcs.2004.10.040_bib5","doi-asserted-by":"crossref","unstructured":"D. Janin, I. Walukiewicz, Automata for the modal \u03bc-calculus and related results, in: MFCS\u201995, Vol. 969, Lecture Notes in Comput. Sci., 1995, pp. 552\u2013562.","DOI":"10.1007\/3-540-60246-1_160"},{"key":"10.1016\/j.tcs.2004.10.040_bib6","doi-asserted-by":"crossref","unstructured":"D. Janin, I. Walukiewicz, On the expressive completeness of the propositional \u03bc-calculus w.r.t. monadic second-order logic, Proc. CONCUR \u201996, Vol. 1119, Lecture Notes in Comput. Sci., 1996, pp. 263\u2013277.","DOI":"10.1007\/3-540-61604-7_60"},{"key":"10.1016\/j.tcs.2004.10.040_bib7","doi-asserted-by":"crossref","first-page":"234","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\/j.tcs.2004.10.040_bib8","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","article-title":"An automata theoretic approach to branching time model checking","volume":"47","author":"Kupferman","year":"2000","journal-title":"J Assoc. Comput. Mech."},{"key":"10.1016\/j.tcs.2004.10.040_bib9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/2275175","article-title":"On an interpretation of second-order quantification in first-order intuitionistic propositional logic","volume":"57","author":"Pitts","year":"1992","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2004.10.040_bib10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"55","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/j.tcs.2004.10.040_bib11","doi-asserted-by":"crossref","unstructured":"A. Visser, Uniform interpolation and layered bisimulation, G\u00f6del \u201996 (Brno, 1996), Lecture Notes Logic, Vol. 6, Springer, Berlin, 1996, pp. 139\u2013164.","DOI":"10.1007\/978-3-662-21963-8_9"},{"key":"10.1016\/j.tcs.2004.10.040_bib12","doi-asserted-by":"crossref","unstructured":"I. Walukiewicz, Monadic second order logic on tree-like structures, in: Symp. Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Vol. 1046, 1996.","DOI":"10.1007\/3-540-60922-9_33"},{"key":"10.1016\/j.tcs.2004.10.040_bib13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/inco.1999.2836","article-title":"Completeness of Kozen's axiomatization of the propositional \u03bc-calculus","volume":"157","author":"Walukiewicz","year":"2000","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007558?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007558?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T01:46:59Z","timestamp":1660268819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397504007558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["S0304397504007558"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2004.10.040","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2005,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An axiomatization of bisimulation quantifiers via the -calculus","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2004.10.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}