{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:40:07Z","timestamp":1743975607220,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327834"},{"type":"electronic","value":"9783642327841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32784-1_1","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:34Z","timestamp":1344862774000},"page":"1-19","source":"Crossref","is-referenced-by-count":2,"title":["From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Zvesper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61604-7_44","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S. Abramsky","year":"1996","unstructured":"Abramsky, S.: Retracing Some Paths in Process Algebra. In: CONCUR 1996. LNCS, vol.\u00a01119, pp. 1\u201317. Springer, Heidelberg (1996)"},{"key":"1_CR2","unstructured":"Abramsky, S.: A Cook\u2019s tour of the finitary non-well-founded sets. In: Artemov, S., Barringer, H., d\u2019Avila Garcez, A., Lamb, L.C., Woods, J. (eds.) We Will Show Them: Essays in Honour of Dov Gabbay, vol.\u00a01, pp. 1\u201318. College Publications (2005)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Coalgebras, Chu spaces, and representations of physical systems. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science, LICS, pp. 411\u2013420. IEEE (2010)","DOI":"10.1109\/LICS.2010.35"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: New foundations for the geometry of interaction. Information and Computation\u00a0111(1), 53\u2013119 (1994)","journal-title":"Information and Computation"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, pp. 1\u2013168. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Melli\u00e9s, P.-A.: Concurrent games and full completeness. In: Proceedings of the Fourteenth International Symposium on Logic in Computer Science, pp. 431\u2013442. IEEE Computer Society Press (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.P.: A Final Coalgebra Theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theor. Comput. Sci.\u00a0114(2), 299\u2013315 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jeth.2001.2942","volume":"106","author":"P. Battigalli","year":"2002","unstructured":"Battigalli, P., Siniscalchi, M.: Strong belief and forward-induction reasoning. Journal of Economic Theory\u00a0106, 356\u2013391 (2002)","journal-title":"Journal of Economic Theory"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1111\/j.1468-0262.2008.00835.x","volume":"76","author":"A. Brandenburger","year":"2008","unstructured":"Brandenburger, A., Friedenberg, A., Keisler, H.J.: Admissibility in games. Econometrica\u00a076, 307\u2013352 (2008)","journal-title":"Econometrica"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11225-006-9011-z","volume":"84","author":"A. Brandenburger","year":"2006","unstructured":"Brandenburger, A., Jerome Keisler, H.: An impossibility theorem on beliefs in games. Studia Logica\u00a084(2), 211\u2013240 (2006)","journal-title":"Studia Logica"},{"key":"1_CR12","unstructured":"Butz, C.: Regular categories and regular logic. Technical Report LS-98-2, BRICS (October 1998)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications, vol.\u00a093. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511542725"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Harsanyi, J.C.: Games with incomplete information played by \u201dBayesian\u201d players, I\u2013III. Part I. The basic model. Management Science\u00a014(3) (1967)","DOI":"10.1287\/mnsc.14.3.159"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1006\/jeth.1998.2435","volume":"82","author":"A. Heifetz","year":"1998","unstructured":"Heifetz, A., Samet, D.: Topology-free typology of beliefs. Journal of Economic Theory\u00a082, 324\u2013381 (1998)","journal-title":"Journal of Economic Theory"},{"issue":"1-2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2004.07.023","volume":"327","author":"C. Kupke","year":"2004","unstructured":"Kupke, C., Kurz, A., de Venema, Y.: Stone coalgebras. Theor. Comput. Sci.\u00a0327(1-2), 109\u2013134 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"William Lawvere, F.: Diagonal arguments and cartesian closed categories. Lecture Notes in Mathematics, vol.\u00a092, pp. 134\u2013145 (1969)","DOI":"10.1007\/BFb0080769"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1090\/S0002-9947-1951-0042109-4","volume":"71","author":"E. Michael","year":"1951","unstructured":"Michael, E.: Topologies on spaces of subsets. Trans. Amer. Math. Soc.\u00a071, 152\u2013182 (1951)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.ic.2005.04.006","volume":"204","author":"L.S. Moss","year":"2006","unstructured":"Moss, L.S., Viglizzo, I.D.: Final coalgebras for functors on measurable spaces. Inf. Comput.\u00a0204(4), 610\u2013636 (2006)","journal-title":"Inf. Comput."},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s11225-007-9069-2","volume":"86","author":"E. Pacuit","year":"2007","unstructured":"Pacuit, E.: Understanding the Brandenburger-Keisler paradox. Studia Logica\u00a086(3), 435\u2013454 (2007)","journal-title":"Studia Logica"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01405490","volume":"2","author":"J. Soto-Andrade","year":"1984","unstructured":"Soto-Andrade, J., Varela, F.J.: Self-reference and fixed points: a discussion and an extension of Lawvere\u2019s theorem. Acta Applicandae Mathematicae\u00a02, 1\u201319 (1984)","journal-title":"Acta Applicandae Mathematicae"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"van Oosten, J.: Basic category theory. Technical Report LS-95-1, BRICS (January 1995)","DOI":"10.7146\/brics.v1i37.21606"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Worrell, J.: Terminal sequences for accessible endofunctors. Electr. Notes Theor. Comput. Sci. 19 (1999)","DOI":"10.1016\/S1571-0661(05)80267-1"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"362","DOI":"10.2178\/bsl\/1058448677","volume":"9","author":"N.S. Yanofsky","year":"2003","unstructured":"Yanofsky, N.S.: A universal approach to self-referential paradoxes and fixed points. Bulletin of Symbolic Logic\u00a09(3), 362\u2013386 (2003)","journal-title":"Bulletin of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32784-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:02:12Z","timestamp":1743973332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32784-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327834","9783642327841"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32784-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}