{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T11:45:49Z","timestamp":1794483949682,"version":"4.9.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319060248","type":"print"},{"value":"9783319060255","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06025-5_1","type":"book-chapter","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T08:47:27Z","timestamp":1409042847000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The Freedoms of (Guarded) Bisimulation"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Otto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka H, van Benthem J, N\u00e9meti I (1998) Modal languages and bounded fragments of predicate logic. J Philoso Logic 27:217\u2013274","journal-title":"J Philoso Logic"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny V, Gottlob G, Otto M (2014) Querying the guarded fragment. Logical Methods Comput Sci (to appear)","DOI":"10.2168\/LMCS-10(2:3)2014"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny V, ten Cate B, Segoufin L (2011) Guarded negation. In: Proceedings of ICALP, pp 356\u2013367","DOI":"10.1007\/978-3-642-22012-8_28"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri C, Fagin R, Maier D, Yannakakis M (1983) On the desirability of acyclic database schemes. J ACM 30:497\u2013513","journal-title":"J ACM"},{"key":"1_CR5","volume-title":"Modal logic and classical logic","author":"J van Benthem","year":"1983","unstructured":"van Benthem J (1983) Modal logic and classical logic. Bibliopolis, Napoli"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10849-005-5786-y","volume":"14","author":"J van Benthem","year":"2005","unstructured":"van Benthem J (2005) Guards, bounds, and generalized semantics. J Logic Lang Inform 14(3):263\u2013279","journal-title":"J Logic Lang Inform"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11787-006-0006-3","volume":"1","author":"J van Benthem","year":"2007","unstructured":"van Benthem J (2007) A new modal Lindstr\u00f6m theorem. Log Univers 1:125\u2013138","journal-title":"Log Univers"},{"key":"1_CR8","unstructured":"van Benthem J, ten Cate B, V\u00e4\u00e4n\u00e4nen J (2007) Lindstr\u00f6m theorems for fragments of first-order logic. In: Proceedings of 22nd IEEE symposium on logic in computer science, LICS 2007, pp 280\u2013292"},{"key":"1_CR9","unstructured":"Berge C (1973) Graphs and hypergraphs. North-Holland, Amsterdam"},{"key":"1_CR10","unstructured":"ten Cate B, Segoufin L (2011) Unary negation. In: Proceedings of STACS, pp 344\u2013355"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2009.04.002","volume":"161","author":"A Dawar","year":"2009","unstructured":"Dawar A, Otto M (2009) Modal characterisation theorems over special classes of frames. Ann Pure Appl Logic 161:1\u201342","journal-title":"Ann Pure Appl Logic"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del E (1999) On the restraining power of guards. J Symbolic Logic 64:1719\u20131742","journal-title":"J Symbolic Logic"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(01)00151-7","volume":"288","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del E (2002) Guarded fixed point logics and the monadic theory of countable trees. Theoret Comput Sci 288:129\u2013152","journal-title":"Theoret Comput Sci"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1145\/507382.507388","volume":"3","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del E, Hirsch C, Otto M (2002) Back and forth between guarded and modal logics. ACM Trans Comput Logics 3:418\u2013463","journal-title":"ACM Trans Comput Logics"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del E, Walukiewicz I (1999) Guarded fixed point logic. In: Proceedings of 14th IEEE symposium on logic in computer science, LICS 1999, pp 45\u201354","DOI":"10.1109\/LICS.1999.782585"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01299742","volume":"15","author":"B Herwig","year":"1995","unstructured":"Herwig B (1995) Extending partial isomorphisms on finite structures. Combinatorica 15:365\u2013371","journal-title":"Combinatorica"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1090\/S0002-9947-99-02374-0","volume":"352","author":"B Herwig","year":"2000","unstructured":"Herwig B, Lascar D (2000) Extending partial isomorphisms and the profinite topology on free groups. Trans AMS 352:1985\u20132021","journal-title":"Trans AMS"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Otto M (2004) Modal and guarded characterisation theorems over finite transition systems. Ann Pure Appl Logic 164(12):1418\u20131453","DOI":"10.1016\/j.apal.2013.06.017"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Otto M (2006) Bisimulation invariance and finite models. In: Colloquium logicum 2002. Lecture notes in logic, pp 276\u2013298, ASL","DOI":"10.1017\/9781316755723.013"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Otto M (2011) Model theoretic methods for fragments of FO and special classes of (finite) structures. In: Esparza J, Michaux C, Steinhorn C (eds) Finite and algorithmic model theory, volume 379 of LMS lecture notes, pp 271\u2013341. CUP","DOI":"10.1017\/CBO9780511974960.007"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Otto M (2012a) Highly acyclic groups, hypergraph covers and the guarded fragment. J ACM 59:1","DOI":"10.1145\/2108242.2108247"},{"key":"1_CR22","unstructured":"Otto M (2012b) On groupoids and hypergraphs. arXiv:1211.5656 (preprint)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Otto M (2013a) Expressive completeness through logically tractable models. Ann Pure Appl Logic 164(12):1418\u20131453","DOI":"10.1016\/j.apal.2013.06.017"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Otto M (2013b) Groupoids, hypergraphs and symmetries in finite models. In: Proceedings of 28th IEEE symposium on logic in computer science, LICS 2013","DOI":"10.1109\/LICS.2013.10"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Otto M (2014) Finite groupoids, finite coverings and symmetries in finite structures. arXiv:1404.4599 (preprint)","DOI":"10.1109\/LICS.2013.10"},{"key":"1_CR26","unstructured":"Otto M, Piro R (2008) A Lindstr\u00f6m characterisation of the guarded fragment and of modal logic with a global modality. In: Areces C, Goldblatt R (eds) Advances in modal logic 7, pp 273\u2013288"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1969-0246760-1","volume":"141","author":"M Rabin","year":"1969","unstructured":"Rabin M (1969) Decidability of second-order theories and automata on infinite trees. Trans AMS 141:1\u201335","journal-title":"Trans AMS"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1008275906015","volume":"6","author":"E Rosen","year":"1997","unstructured":"Rosen E (1997) Modal logic over finite structures. J Logic Lang Inform 6:427\u2013439","journal-title":"J Logic Lang Inform"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Rossman B (2008) Homomorphism preservation theorems. J ACM 55:1\u201353","DOI":"10.1145\/1379759.1379763"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Vardi M (1998) Reasoning about the past with two-way automata. In: Automata, languages and programming ICALP 98. Lecture notes in computer science, vol 1443. Springer, pp 628\u2013641","DOI":"10.1007\/BFb0055090"}],"container-title":["Outstanding Contributions to Logic","Johan van Benthem on Logic and Information Dynamics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06025-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T03:47:40Z","timestamp":1676864860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06025-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319060248","9783319060255"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06025-5_1","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-06025-5","asserted-by":"object"}]},"ISSN":["2211-2758","2211-2766"],"issn-type":[{"value":"2211-2758","type":"print"},{"value":"2211-2766","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}