{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:24:09Z","timestamp":1743074649609,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319913759"},{"type":"electronic","value":"9783319913766"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-91376-6_55","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T11:19:05Z","timestamp":1526469545000},"page":"607-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Proof Theory for Heterogeneous Logic Combining Sentences and Diagrams"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Takemura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"55_CR1","volume-title":"Logical Reasoning with Diagrams & Sentences: Using Hyperproof","author":"D Barker-Plummer","year":"2017","unstructured":"Barker-Plummer, D., Barwise, J., Etchemendy, J.: Logical Reasoning with Diagrams & Sentences: Using Hyperproof. CSLI Publications, Stanford (2017)"},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.jvlc.2010.11.006","volume":"22","author":"D Barker-Plummer","year":"2011","unstructured":"Barker-Plummer, D., Swoboda, N.: Reasoning with coincidence grids\u2013a sequent-based logic and an analysis of complexity. J. Vis. Lang. Comput. 22(1), 56\u201365 (2011)","journal-title":"J. Vis. Lang. Comput."},{"key":"55_CR3","volume-title":"Hyperproof: For Macintosh","author":"J Barwise","year":"1995","unstructured":"Barwise, J., Etchemendy, J.: Hyperproof: For Macintosh. The Center for the Study of Language and Information Publications, Stanford (1995)"},{"key":"55_CR4","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, 4th edn. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-85108-0","edition":"4"},{"key":"55_CR5","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen, Mathematische Zeitschrift, 39, 176\u2013210, 405\u2013431 (1934). English Translation: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen (1969)"},{"issue":"1","key":"55_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1305\/ndjfl\/1040609295","volume":"35","author":"E Hammer","year":"1994","unstructured":"Hammer, E.: Reasoning with sentences and diagrams. Notre Dame J. Form. Log. 35(1), 73\u201387 (1994)","journal-title":"Notre Dame J. Form. Log."},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1112\/S1461157000000942","volume":"8","author":"J Howse","year":"2005","unstructured":"Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS J. Comput. Math. 8, 145\u2013194 (2005). London Mathematical Society","journal-title":"LMS J. Comput. Math."},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Linker, S., Burton, J., Jamnik, M.: Tactical diagrammatic reasoning. In: Proceedings of 12th Workshop on User Interfaces for Theorem Provers, EPTCS, vol. 239, pp. 29\u201342 (2017)","DOI":"10.4204\/EPTCS.239.3"},{"issue":"3","key":"55_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10849-012-9160-6","volume":"21","author":"K Mineshima","year":"2012","unstructured":"Mineshima, K., Okada, M., Takemura, R.: A diagrammatic inference system with Euler circles. J. Log. Lang. Inform. 21(3), 365\u2013391 (2012)","journal-title":"J. Log. Lang. Inform."},{"key":"55_CR10","volume-title":"Natural Deduction","author":"D Prawitz","year":"1965","unstructured":"Prawitz, D.: Natural Deduction. Almqvist & Wiksell, Stockholm (1965). (Dover 2006)"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Prawitz, D.: Ideas and results in proof theory. In: Proceedings of 2nd Scandinavian Logic Symposium, pp. 237\u2013309 (1971)","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"55_CR12","volume-title":"The Logical Status of Diagrams","author":"S-J Shin","year":"1994","unstructured":"Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1994)"},{"key":"55_CR13","volume-title":"Semantic Properties of Diagrams and Their Cognitive Potentials","author":"A Shimojima","year":"2015","unstructured":"Shimojima, A.: Semantic Properties of Diagrams and Their Cognitive Potentials. CSLI Publications, Stanford (2015)"},{"key":"55_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.entcs.2005.02.023","volume":"134","author":"N Swoboda","year":"2005","unstructured":"Swoboda, N., Allwein, G.: Heterogeneous reasoning with Euler\/Venn diagrams containing named constants and FOL. Electron. Notes Theoret. Comput. Sci. 134, 153\u2013187 (2005)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"issue":"1","key":"55_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11225-012-9370-6","volume":"101","author":"R Takemura","year":"2013","unstructured":"Takemura, R.: Proof theory for reasoning with Euler diagrams: a logic translation and normalization. Stud. Logica. 101(1), 157\u2013191 (2013)","journal-title":"Stud. Logica."},{"key":"55_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-31223-6_42","volume-title":"Diagrammatic Representation and Inference","author":"R Takemura","year":"2012","unstructured":"Takemura, R., Shimojima, A., Katagiri, Y.: A logical investigation on global reading of diagrams. In: Cox, P., Plimmer, B., Rodgers, P. (eds.) Diagrams 2012. LNCS (LNAI), vol. 7352, pp. 330\u2013333. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31223-6_42"},{"key":"55_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-22863-6_29","volume-title":"Interactive Theorem Proving","author":"M Urbas","year":"2011","unstructured":"Urbas, M., Jamnik, M.: Heterogeneous proofs: spider diagrams meet higher-order provers. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 376\u2013382. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22863-6_29"},{"issue":"4","key":"55_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10849-015-9229-0","volume":"24","author":"M Urbas","year":"2015","unstructured":"Urbas, M., Jamnik, M., Stapleton, G.: Speedith: a reasoner for spider diagrams. J. Log. Lang. Inform. 24(4), 487\u2013540 (2015)","journal-title":"J. Log. Lang. Inform."}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91376-6_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:58:29Z","timestamp":1558324709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91376-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319913759","9783319913766"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91376-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Diagrams","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Application of Diagrams","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"diagrams2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.diagrams-conference.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}