{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:37Z","timestamp":1725897637955},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_29","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"299-311","source":"Crossref","is-referenced-by-count":7,"title":["Coalgebraic Predicate Logic"],"prefix":"10.1007","author":[{"given":"Tadeusz","family":"Litak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhiko","family":"Sano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_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"},{"key":"29_CR2","unstructured":"van Benthem, J.: Modal Correspondence Theory. Ph.D. thesis, Department of Mathematics, University of Amsterdam (1976)"},{"issue":"1-2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.apal.2008.11.001","volume":"159","author":"B. Cate ten","year":"2009","unstructured":"ten Cate, B., Gabelaia, D., Sustretov, D.: Modal languages for topology: Expressivity and definability. Ann. Pure Appl. Logic\u00a0159(1-2), 146\u2013170 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Chang, C.: Modal model theory. In: Cambridge Summer School in Mathematical Logic. LNM, vol.\u00a0337, pp. 599\u2013617. Springer (1973)","DOI":"10.1007\/BFb0066792"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chellas, B.: Modal Logic. Cambridge University Press (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/comjnl\/bxp004","volume":"54","author":"C. Cirstea","year":"2011","unstructured":"Cirstea, C., Kurz, A., Pattinson, D., Schr\u00f6der, L., Venema, Y.: Modal logics are coalgebraic. The Computer J.\u00a054, 31\u201341 (2011)","journal-title":"The Computer J."},{"key":"29_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11814771_44","volume-title":"Automated Reasoning","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lugiez, D.: Presburger Modal Logic Is PSPACE-Complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 541\u2013556. Springer, Heidelberg (2006)"},{"key":"29_CR8","unstructured":"Enderton, H.B.: A mathematical introduction to logic. Academic Press (1972)"},{"key":"29_CR9","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":"29_CR10","unstructured":"Goldblatt, R.: An abstract setting for Henkin proofs. CSLI Lecture Notes, pp. 191\u2013212. CSLI Publications (1993)"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"J.Y. Halpern","year":"1990","unstructured":"Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell.\u00a046(3), 311\u2013350 (1990)","journal-title":"Artif. Intell."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Neighbourhood structures: Bisimilarity and basic model theory. Log. Methods Comput. Sci. 5 (2009)","DOI":"10.2168\/LMCS-5(2:2)2009"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1305\/ndjfl\/1168352661","volume":"47","author":"I. Hodkinson","year":"2006","unstructured":"Hodkinson, I.: Hybrid formulas and elementarily generated modal logics. Notre Dame J. Formal Logic\u00a047, 443\u2013478 (2006)","journal-title":"Notre Dame J. Formal Logic"},{"key":"29_CR14","unstructured":"Jacobs, B.: Predicate logic for functors and monads (2010)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11548133_17","volume-title":"Algebra and Coalgebra in Computer Science","author":"C. Kupke","year":"2005","unstructured":"Kupke, C., Kurz, A., Pattinson, D.: Ultrafilter Extensions for Coalgebras. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 263\u2013277. Springer, Heidelberg (2005)"},{"key":"29_CR16","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":"29_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/malq.19770230702","volume":"23","author":"J.A. Makowsky","year":"1977","unstructured":"Makowsky, J.A., Marcja, A.: Completeness theorems for modal model theory with the Montague-Chang semantics I. Math. Logic Quarterly\u00a023, 97\u2013104 (1977)","journal-title":"Math. Logic Quarterly"},{"key":"29_CR18","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":"29_CR19","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.ic.2009.11.008","volume":"208","author":"D. Pattinson","year":"2010","unstructured":"Pattinson, D., Schr\u00f6der, L.: Cut elimination in coalgebraic logics. Inf. Comput.\u00a0208, 1447\u20131468 (2010)","journal-title":"Inf. Comput."},{"key":"29_CR20","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."},{"issue":"4","key":"29_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1008275906015","volume":"6","author":"E. Rosen","year":"1997","unstructured":"Rosen, E.: Modal logic over finite structures. J. Logic, Language and Information\u00a06(4), 427\u2013439 (1997)","journal-title":"J. Logic, Language and Information"},{"key":"29_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1379759.1379763","volume":"55","author":"B. Rossman","year":"2008","unstructured":"Rossman, B.: Homomorphism preservation theorems. J. ACM 55, 15:1\u201315:53 (2008)","journal-title":"J. ACM"},{"key":"29_CR23","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":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-12032-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Schr\u00f6der","year":"2010","unstructured":"Schr\u00f6der, L., Pattinson, D.: Coalgebraic Correspondence Theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 328\u2013342. Springer, Heidelberg (2010)"},{"key":"29_CR25","unstructured":"Schr\u00f6der, L., Pattinson, D.: Named models in coalgebraic hybrid logic. In: Symposium on Theoretical Aspects of Computer Science, STACS 2010. Leibniz Int. Proceedings in Informatics, vol.\u00a05, pp. 645\u2013656. Schloss Dagstuhl \u2013 Leibniz-Center of Informatics (2010)"},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1093\/logcom\/exn096","volume":"20","author":"L. Schr\u00f6der","year":"2010","unstructured":"Schr\u00f6der, L., Pattinson, D.: Rank-1 modal logics are coalgebraic. J. Log. Comput.\u00a020, 1113\u20131147 (2010)","journal-title":"J. Log. Comput."},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-18026-2_15","volume-title":"Logic and Its Applications","author":"J. Seligman","year":"2011","unstructured":"Seligman, J., Liu, F., Girard, P.: Logic in the Community. In: Banerjee, M., Seth, A. (eds.) ICLA 2011. LNCS, vol.\u00a06521, pp. 178\u2013188. Springer, Heidelberg (2011)"},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/S0002-9947-1980-0554321-4","volume":"258","author":"J. Sgro","year":"1980","unstructured":"Sgro, J.: The interior operator logic and product topologies. Trans. AMS\u00a0258, 99\u2013112 (1980)","journal-title":"Trans. AMS"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. Log. Methods Comput. Sci. 7 (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"},{"key":"29_CR30","unstructured":"Ziegler, A.: Topological model theory. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics. Springer (1985)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:35Z","timestamp":1620130415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}