{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:53Z","timestamp":1725471173015},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371045"},{"type":"electronic","value":"9783540371069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812289_10","type":"book-chapter","created":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T08:23:44Z","timestamp":1159518224000},"page":"110-123","source":"Crossref","is-referenced-by-count":8,"title":["Verifying and Invalidating Textbook Proofs Using Scunak"],"prefix":"10.1007","author":[{"given":"Chad E.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Mathematical Knowledge Management","author":"S. Autexier","year":"2006","unstructured":"Autexier, S., Fiedler, A.: Textbook proofs meet formal logic - the problem of underspecification and granularity. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol.\u00a03863, Springer, Heidelberg (2006)"},{"key":"10_CR2","volume-title":"Introduction to Real Analysis","author":"R.G. Bartle","year":"1982","unstructured":"Bartle, R.G., Sherbert, D.R.: Introduction to Real Analysis. John Wiley & Sons, New York (1982)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Information and Computation\u00a076, 95\u2013120 (1988)","journal-title":"Information and Computation"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Grabowski, A., Schwarzweller, C.: Translating mathematical vernacular into knowledge repositories. In: Kohlhase [11], pp. 49\u201364","DOI":"10.1007\/11618027_4"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"J. Roger Hindley","year":"1997","unstructured":"Roger Hindley, J.: Basic Simple Type Theory. Cambridge University Press, Cambridge (1997)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Jojgov, G.I.: Translating a fragment of weak type theory into type theory with open terms. In: Kohlhase [11], pp. 389\u2013403","DOI":"10.1007\/11618027_26"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-27818-4_11","volume-title":"Mathematical Knowledge Management","author":"G.I. Jojgov","year":"2004","unstructured":"Jojgov, G.I., Nederpelt, R.: A path to faithful formalizations of mathematics. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol.\u00a03119, pp. 145\u2013159. Springer, Heidelberg (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kamareddine, F., Maarek, M., Wells, J.B.: Toward an object-oriented structure for mathematical text. In: Kohlhase [11], pp. 217\u2013233","DOI":"10.1007\/11618027_15"},{"key":"10_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44990-6_3","volume-title":"Artificial Intelligence and Symbolic Computation","author":"M. Kohlhase","year":"2001","unstructured":"Kohlhase, M.: Omdoc: Towards an internet standard for the administration, distribution, and teaching of mathematical knowledge. In: Campbell, J.A., Roanes-Lozano, E. (eds.) AISC 2000. LNCS (LNAI), vol.\u00a01930, pp. 32\u201352. Springer, Heidelberg (2001)"},{"key":"10_CR11","unstructured":"Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol.\u00a03863, Springer, Heidelberg (2006)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/LICS.2001.932499","volume-title":"Proceedings of the Sixteenth Annual IEEE Symp. on Logic in Computer Science, LICS 2001","author":"F. Pfenning","year":"2001","unstructured":"Pfenning, F.: Intensionality, extensionality, and proof irrelevance in modal type theory. In: Halpern, J. (ed.) Proceedings of the Sixteenth Annual IEEE Symp. on Logic in Computer Science, LICS 2001, p. 221. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"10_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System Description: Twelf\u2013A Meta-Logical Framework for Deductive Systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"10_CR14","unstructured":"Reed, J.: Proof irrelevance and strict definitions in a logical framework. Technical Report 02-153, School of Computer Science, Carnegie Mellon University (2002)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-36469-2_13","volume-title":"Mathematical Knowledge Management","author":"P. Rudnicki","year":"2003","unstructured":"Rudnicki, P., Trybulec, A.: On the integrity of a repository of formalized mathematics. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol.\u00a02594, pp. 162\u2013174. Springer, Heidelberg (2003)"},{"issue":"3\u20134","key":"10_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1021983302516","volume":"29","author":"F. Wiedijk","year":"2002","unstructured":"Wiedijk, F.: A new implementation of Automath. J. Autom. Reasoning\u00a029(3\u20134), 365\u2013387 (2002)","journal-title":"J. Autom. Reasoning"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Wiedijk, F.: Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics. Journal of Applied Logic\u00a04 (to appear, 2006)","DOI":"10.1016\/j.jal.2005.10.011"}],"container-title":["Lecture Notes in Computer Science","Mathematical Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812289_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:02Z","timestamp":1605644042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812289_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371045","9783540371069"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11812289_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}