{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:49:44Z","timestamp":1759146584735},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_36","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"524-538","source":"Crossref","is-referenced-by-count":10,"title":["Flat Coalgebraic Fixed Point Logics"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Yde","family":"Venema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM\u00a049, 672\u2013713 (2002)","journal-title":"J. ACM"},{"volume-title":"The Description Logic Handbook","year":"2003","key":"36_CR2","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"36_CR3","series-title":"ENTCS","first-page":"41","volume-title":"Methods for Modalities (M4M-5, 2007)","author":"G. Calin","year":"2009","unstructured":"Calin, G., Myers, R., Pattinson, D., Schr\u00f6der, L.: CoLoSS: The Coalgebraic Logic Satisfiability Solver (system description). In: Methods for Modalities (M4M-5, 2007). ENTCS, vol.\u00a0231, pp. 41\u201354. Elsevier, Amsterdam (2009)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04027-6_15","volume-title":"Computer Science Logic","author":"C. C\u00eerstea","year":"2009","unstructured":"C\u00eerstea, C., Kupke, C., Pattinson, D.: EXPTIME tableaux for the coalgebraic \u03bc-calculus. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 179\u2013193. Springer, Heidelberg (2009)"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"G. D\u2019Agostino","year":"2002","unstructured":"D\u2019Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic\u00a041, 267\u2013298 (2002)","journal-title":"Arch. Math. Logic"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)90269-0","volume":"126","author":"M. Dam","year":"1994","unstructured":"Dam, M.: CTL* and ECTL* as fragments of the modal mu-calculus. Theoret. Comput. Sci.\u00a0126, 77\u201396 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E.A. Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program\u00a02(3), 241\u2013266 (1982)","journal-title":"Sci. Comput. Program"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","volume":"30","author":"E.A. Emerson","year":"1985","unstructured":"Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. System Sci.\u00a030, 1\u201324 (1985)","journal-title":"J. Comput. System Sci."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"E.A. Emerson","year":"1999","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM J. Comput.\u00a029, 132\u2013158 (1999)","journal-title":"SIAM J. Comput."},{"key":"36_CR10","first-page":"267","volume-title":"Logic in Computer Science, LICS 1986","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional mu-calculus. In: Logic in Computer Science, LICS 1986, pp. 267\u2013278. IEEE, Los Alamitos (1986)"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2005.07.043","volume":"353","author":"V. Goranko","year":"2006","unstructured":"Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theoret. Comput. Sci.\u00a0353, 93\u2013117 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-642-12002-2_9","volume-title":"TACAS 2010","author":"R. Gor\u00e9","year":"2010","unstructured":"Gor\u00e9, R., Kupke, C., Pattinson, D.: Optimal tableau algorithms for coalgebraic logics. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 114\u2013128. Springer, Heidelberg (2010)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoret. Comput. Sci.\u00a027, 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D. Kozen","year":"1981","unstructured":"Kozen, D., Parikh, R.: An elementary proof of the completeness of PDL. Theoret. Comput. Sci.\u00a014, 113\u2013118 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-45620-1_34","volume-title":"Automated Deduction - CADE-18","author":"O. Kupferman","year":"2002","unstructured":"Kupferman, O., Sattler, U., Vardi, M.Y.: The complexity of the graded \u03bc-calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 423\u2013437. Springer, Heidelberg (2002)"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S030500410005204X","volume":"79","author":"R. Laver","year":"1976","unstructured":"Laver, R.: Well-quasi-orders and sets of finite sequences. Math. Proc. Cambridge Philos. Soc.\u00a079, 1\u201310 (1976)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"36_CR19","volume-title":"Convention, A Philosophical Study","author":"D. Lewis","year":"1969","unstructured":"Lewis, D.: Convention, A Philosophical Study. Harvard University Press, Cambridge (1969)"},{"key":"36_CR20","first-page":"111","volume":"24","author":"R. Parikh","year":"1985","unstructured":"Parikh, R.: The logic of games and its applications. Annals of Discrete Mathematics\u00a024, 111\u2013140 (1985)","journal-title":"Annals of Discrete Mathematics"},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1305\/ndjfl\/1094155277","volume":"45","author":"D. Pattinson","year":"2004","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic\u00a045, 19\u201333 (2004)","journal-title":"Notre Dame J. Formal Logic"},{"key":"36_CR22","unstructured":"Pattinson, D., Schr\u00f6der, L.: Cut elimination in coalgebraic logics. Inf. Comput. (to appear)"},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Log. Comput.\u00a012, 149\u2013166 (2002)","journal-title":"J. Log. Comput."},{"key":"36_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D. Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM\u00a034, 450\u2013479 (1987)","journal-title":"J. ACM"},{"key":"36_CR25","first-page":"109","volume-title":"Foundations of Computer Science, FOCS 1976","author":"V.R. Pratt","year":"1976","unstructured":"Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: Foundations of Computer Science, FOCS 1976, pp. 109\u2013121. IEEE, Los Alamitos (1976)"},{"key":"36_CR26","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.apal.2007.11.001","volume":"154","author":"L. Santocanale","year":"2008","unstructured":"Santocanale, L.: Completions of \u03bc-algebras. Ann. Pure Appl. Logic\u00a0154, 27\u201350 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"key":"36_CR27","unstructured":"Santocanale, L., Venema, Y.: Completeness for flat modal fixpoint logics. Annals Pure Appl. Log. (preprint under) (to appear), \n                  \n                    http:\/\/arxiv.org\/abs\/0812.2390"},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jlap.2006.11.004","volume":"73","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog.\u00a073, 97\u2013110 (2007)","journal-title":"J. Log. Algebr. Prog."},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462179.1462185","volume":"10","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log.\u00a010, 13:1\u201313:33 (2009)","journal-title":"ACM Trans. Comput. Log."},{"key":"36_CR30","first-page":"673","volume-title":"Theoretical Aspects of Computer Science, STACS 2009","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: Strong completeness of coalgebraic modal logics. In: Theoretical Aspects of Computer Science, STACS 2009, pp. 673\u2013684. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2009)"},{"key":"36_CR31","first-page":"917","volume-title":"International Joint Conferences on Artificial Intelligence, IJCAI 2009","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D., Kupke, C.: Nominals for everyone. In: International Joint Conferences on Artificial Intelligence, IJCAI 2009, pp. 917\u2013922. AAAI Press, Menlo Park (2009)"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Segerberg, K.: A completeness theorem in the modal logic of programs. In: Universal Algebra and Applications. Banach Centre Publications, vol.\u00a09, pp. 31\u201346. PWN (1982)","DOI":"10.4064\/-9-1-31-46"},{"key":"36_CR33","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional \u03bc-calculus. Inf. Comput.\u00a0157, 142\u2013182 (2000)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:43Z","timestamp":1606187143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}