{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:12Z","timestamp":1725488832952},"publisher-location":"Berlin, Heidelberg","reference-count":2,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438656"},{"type":"electronic","value":"9783540454700"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45470-5_3","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T02:38:36Z","timestamp":1186886316000},"page":"4-6","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deduction versus Computation: The Case of Induction"],"prefix":"10.1007","author":[{"given":"Eric","family":"Deplagne","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"3_CR1","unstructured":"Gilles Dowek, Th\u00e9r\u00e8se Hardin, and Claude Kirchner. Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, April 1998. \n                    ftp:\/\/ftp.inria.fr\/INRIA\/publication\/RR\/RR-3400.ps.gz\n                    \n                  ."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0960129500003236","volume":"11","author":"G. Dowek","year":"2001","unstructured":"Gilles Dowek, Th\u00e9r\u00e8se Hardin, and Claude Kirchner. HOL-\u03bb\u03c3 an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science, 11(1):21\u201345, 2001.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence, Automated Reasoning, and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45470-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:23:04Z","timestamp":1558261384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45470-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438656","9783540454700"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/3-540-45470-5_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"21 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}