{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:32:48Z","timestamp":1743089568006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030411022"},{"type":"electronic","value":"9783030411039"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41103-9_2","type":"book-chapter","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T15:04:59Z","timestamp":1581692699000},"page":"17-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cathoristic Logic"],"prefix":"10.1007","author":[{"given":"Richard","family":"Evans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Berger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"2_CR1","unstructured":"Haskell implementation of cathoristic logic. Submitted with the paper (2014)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational interpretations of linear logic. TCS 111, 3\u201357 (1993)","journal-title":"TCS"},{"volume-title":"Concise Encyclopedia of Semantics","year":"2009","key":"2_CR3","unstructured":"Allan, K. (ed.): Concise Encyclopedia of Semantics. Elsevier, Boston (2009)"},{"volume-title":"The Handbook of Linguistics","year":"2003","key":"2_CR4","unstructured":"Aronoff, M., Rees-Miller, J. (eds.): The Handbook of Linguistics. Wiley-Blackwell, Hoboken (2003)"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"key":"2_CR6","volume-title":"Knowledge Representation and Reasoning","author":"R Brachman","year":"2004","unstructured":"Brachman, R., Levesque, H.: Knowledge Representation and Reasoning. Morgan Kaufmann, Burlington (2004)"},{"key":"2_CR7","volume-title":"Making It Explicit","author":"R Brandom","year":"1998","unstructured":"Brandom, R.: Making It Explicit. Harvard University Press, Cambridge (1998)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199542871.001.0001","volume-title":"Between Saying and Doing","author":"R Brandom","year":"2008","unstructured":"Brandom, R.: Between Saying and Doing. Oxford University Press, Oxford (2008)"},{"key":"2_CR9","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"2_CR10","volume-title":"Essays on Actions and Events","author":"D Davidson","year":"1980","unstructured":"Davidson, D.: Essays on Actions and Events. Oxford University Press, Oxford (1980)"},{"key":"2_CR11","volume-title":"A Mathematical Introduction to Logic","author":"HB Enderton","year":"2001","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, Cambridge (2001)"},{"key":"2_CR12","unstructured":"Evans, R., Short, E.: Versu. http:\/\/www.versu.com . https:\/\/itunes.apple.com\/us\/app\/blood-laurels\/id882505676?mt=8"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TCIAIG.2013.2287297","volume":"6","author":"R Evans","year":"2014","unstructured":"Evans, R., Short, E.: Versu - a simulationist storytelling system. IEEE Trans. Comput. Intell. AI Games 6(2), 113\u2013130 (2014)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.: Strips: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. TCS 50, 1\u2013101 (1987)","journal-title":"TCS"},{"key":"2_CR16","series-title":"MIT Press Series in the Foundations of Computing","volume-title":"Algebraic Theory of Processes","author":"M Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. MIT Press, Cambridge (1988)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for non-determinism and concurrency. JACM 32(1), 137\u2013161 (1985)","journal-title":"JACM"},{"key":"2_CR18","unstructured":"Honda, K.: A Theory of Types for the $$\\pi $$-Calculus, March 2001. http:\/\/www.dcs.qmul.ac.uk\/~kohei\/logics"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"Programming Languages and Systems","author":"K Honda","year":"1998","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122\u2013138. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053567"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/565816.503281","volume":"37","author":"K Honda","year":"2002","unstructured":"Honda, K., Yoshida, N.: A uniform type structure for secure information flow. SIGPLAN Not. 37, 81\u201392 (2002)","journal-title":"SIGPLAN Not."},{"volume-title":"The Routledge Handbook of Corpus Linguistics","year":"2010","key":"2_CR21","unstructured":"O\u2019Keeffe, A., McCarthy, M. (eds.): The Routledge Handbook of Corpus Linguistics. Routledge, Abingdon (2010)"},{"key":"2_CR22","unstructured":"Peregrin, J.: Logic as based on incompatibility (2010). http:\/\/philpapers.org\/rec\/PERLAB-2"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139084673"},{"key":"2_CR24","volume-title":"An Inquiry into Meaning and Truth","author":"B Russell","year":"1940","unstructured":"Russell, B.: An Inquiry into Meaning and Truth. Norton and Co, New York (1940)"},{"key":"2_CR25","volume-title":"Introduction to Bisimulation and Coinduction","author":"D Sangiorgi","year":"2012","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, Cambridge (2012)"},{"issue":"1\u20132","key":"2_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","volume":"170","author":"V Sassone","year":"1996","unstructured":"Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. TCS 170(1\u20132), 297\u2013348 (1996)","journal-title":"TCS"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0004-3702(85)90028-1","volume":"26","author":"D Smith","year":"1985","unstructured":"Smith, D., Genesereth, M.: Ordering conjunctive queries. Artif. Intell. 26, 171\u2013215 (1985)","journal-title":"Artif. Intell."},{"key":"2_CR28","volume-title":"The Logic of Natural Language","author":"F Sommers","year":"1982","unstructured":"Sommers, F.: The Logic of Natural Language. Clarendon Press, Oxford (1982)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-58184-7_118","volume-title":"PARLE\u201994 Parallel Architectures and Languages Europe","author":"K Takeuchi","year":"1994","unstructured":"Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398\u2013413. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58184-7_118"},{"key":"2_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"AS Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"key":"2_CR31","unstructured":"Turbanti, G.: Modality in Brandom\u2019s incompatibility semantics. In: Proceedings of the Amsterdam Graduate Conference - Truth, Meaning, and Normativity (2011)"},{"key":"2_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85108-0","volume-title":"Logic and Structure","author":"D Dalen van","year":"2004","unstructured":"van Dalen, D.: Logic and Structure. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-85108-0"},{"key":"2_CR33","volume-title":"Philosophische Bemerkungen","author":"L Wittgenstein","year":"1981","unstructured":"Wittgenstein, L.: Philosophische Bemerkungen. Suhrkamp Verlag, Frankfurt (1981). Edited by R. Rhees"},{"key":"2_CR34","doi-asserted-by":"publisher","DOI":"10.4324\/9780203010341","volume-title":"Tractatus Logico-Philosophicus: Logisch-Philosophische Abhandlung","author":"L Wittgenstein","year":"2003","unstructured":"Wittgenstein, L.: Tractatus Logico-Philosophicus: Logisch-Philosophische Abhandlung. Suhrkamp Verlag, Frankfurt (2003). Originally published: 1921"}],"container-title":["Lecture Notes in Computer Science","From Lambda Calculus to Cybersecurity Through Program Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41103-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T16:31:51Z","timestamp":1665851511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41103-9_2"}},"subtitle":["A Logic for Capturing Inferences Between Atomic\u00a0Sentences"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030411022","9783030411039"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41103-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}