{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:19Z","timestamp":1760079319636,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746201"},{"type":"electronic","value":"9783540746218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74621-8_12","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T11:46:32Z","timestamp":1187783192000},"page":"178-192","source":"Crossref","is-referenced-by-count":1,"title":["Idempotent Transductions for Modal Logics"],"prefix":"10.1007","author":[{"given":"Tim","family":"French","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Visser, A.: Uniform interpolation and layered bisimulation. In: Godel 1996. Lecture Notes Logic. vol. 6, pp. 139\u2013164 (1996)","DOI":"10.1007\/978-3-662-21963-8_9"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01061237","volume":"55","author":"S. Ghilardi","year":"1995","unstructured":"Ghilardi, S., Zawadowski, M.: Undefinability of propositional quantifiers in the modal system S4. Studia Logica\u00a055, 259\u2013271 (1995)","journal-title":"Studia Logica"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G. D\u2019Agostino","year":"2000","unstructured":"D\u2019Agostino, G., Hollenberg, M.: Logical questions concerning the \u03bc-calculus: interpolation, Lyndon and Los-Tarski. J. Symb. Log.\u00a065(1), 310\u2013332 (2000)","journal-title":"J. Symb. Log."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2004.10.040","volume":"338","author":"G. D\u2019Agostino","year":"2005","unstructured":"D\u2019Agostino, G., Lenzi, G.: An axiomatization of bisimulation quantifiers via the \u03bc-calculus. Theor. Comput. Sci.\u00a0338, 64\u201395 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1111\/j.1755-2567.1970.tb00432.x","volume":"36","author":"K. Fine","year":"1970","unstructured":"Fine, K.: Propositional quantifiers in modal logic. Theoria\u00a036, 336\u2013346 (1970)","journal-title":"Theoria"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"A Calculus of Communication Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-009-6259-0_4","volume":"2","author":"J. Benthem van","year":"1984","unstructured":"van Benthem, J.: Correspondence theory. Handbook of Philosophical Logic\u00a02, 167\u2013247 (1984)","journal-title":"Handbook of Philosophical Logic"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BFb0055763","volume-title":"Mathematical Foundations of Computer Science 1998","author":"C. Stirling","year":"1998","unstructured":"Stirling, C.: The joys of bisimulation. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 142\u2013151. Springer, Heidelberg (1998)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"12_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about knowledge. MIT Press, Cambridge (1995)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11590156_32","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"T. French","year":"2005","unstructured":"French, T.: Bisimulation quantified logics: undecidability. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 396\u2013407. Springer, Heidelberg (2005)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.3166\/jancl.16.297-309","volume":"16","author":"G. D\u2019Agostino","year":"2006","unstructured":"D\u2019Agostino, G., Lenzi, G., French, T.: mu-programs, unifrom interpolation and bisimulation quantifiers. Journal of Applied Non-classical Logics\u00a016, 297\u2013310 (2006)","journal-title":"Journal of Applied Non-classical Logics"},{"key":"12_CR14","first-page":"147","volume":"6","author":"T. French","year":"2006","unstructured":"French, T.: Bisimulation quantified modal logics: decidability. Advances in Modal Logic\u00a06, 147\u2013166 (2006)","journal-title":"Advances in Modal Logic"},{"key":"12_CR15","unstructured":"French, T.: Bisimulation quantifiers for modal logic. PhD thesis, The University of Western Australia (2006) Available from http:\/\/people.csse.uwa.edu.au\/tim\/"},{"key":"12_CR16","volume-title":"Many Dimensional Modal Logics: Theory and Applications","author":"D. Gabbay","year":"2003","unstructured":"Gabbay, D., Kurucz, A., Wolter, F., Zakharayashev, M.: Many Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)"},{"key":"12_CR17","first-page":"9","volume":"4","author":"K. Engelhardt","year":"2003","unstructured":"Engelhardt, K., van der Meyden, R., Su, K.: Modal logics with a linear hierarchy of local propositional quantifiers. Advances in Modal Logic\u00a04, 9\u201330 (2003)","journal-title":"Advances in Modal Logic"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"French, T.: Decidability of propositionally quantified logics of knowledge. In: Australian Conference on Artificial Intelligence, pp. 352\u2013363 (2003)","DOI":"10.1007\/978-3-540-24581-0_30"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082(2), 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: Specifying concurrent program modules. ACM Trans. Program. Lang. Syst.\u00a05(2), 190\u2013222 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M. Vardi","year":"1998","unstructured":"Vardi, M.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theor. Comp. Sci. 27 (1983)","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal \u03bc-calculus and related results. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 552\u2013562. Springer, Heidelberg (1995)"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","volume-title":"Proceedings of the 32nd annual symposium on Foundations of computer science","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus and determinacy. In: Proceedings of the 32nd annual symposium on Foundations of computer science, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"volume-title":"Automata, Logics, and Infinite Games","year":"2002","key":"12_CR25","unstructured":"Gradel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T14:38:33Z","timestamp":1737383913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746201","9783540746218"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}