{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:48Z","timestamp":1725471168624},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_19","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T15:44:21Z","timestamp":1160063061000},"page":"205-219","source":"Crossref","is-referenced-by-count":6,"title":["Combining Type Theory and Untyped Set Theory"],"prefix":"10.1007","author":[{"given":"Chad E.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11559306_17","volume-title":"Frontiers of Combining Systems","author":"A. Abel","year":"2005","unstructured":"Abel, A., Coquand, T., Norell, U.: Connecting a logical framework to a first-order logic prover. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, Springer, Heidelberg (2005)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"P.B. Andrews","year":"1996","unstructured":"Andrews, P.B., Bishop, M.: On sets, types, fixed points, and checkerboards. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol.\u00a01071, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/10721959_11","volume-title":"Automated Deduction - CADE-17","author":"P.B. Andrews","year":"2000","unstructured":"Andrews, P.B., Bishop, M., Brown, C.E.: System description: TPS: A theorem proving system for type theory. In: CADE 2000. LNCS, vol.\u00a01831, pp. 164\u2013169. Springer, Heidelberg (2000)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-27818-4_3","volume-title":"Mathematical Knowledge Management","author":"A. Avron","year":"2004","unstructured":"Avron, A.: Formalizing set theory as it is actually used. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol.\u00a03119, pp. 32\u201343. Springer, Heidelberg (2004)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1006050629424","volume":"22","author":"J.G.F. Belinfante","year":"1999","unstructured":"Belinfante, J.G.F.: Computer Proofs in G\u00f6del\u2019s class theory with equational definitions for composite and cross. Journal of Automated Reasoning\u00a022, 311\u2013339 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02328452","volume":"2","author":"R. Boyer","year":"1986","unstructured":"Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., Wos, L.: Set theory in first-order logic: Clauses for G\u00f6del\u2019s axioms. Journal of Automated Reasoning\u00a02, 287\u2013327 (1986)","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10817-004-8271-4","volume":"34","author":"D. Cantone","year":"2005","unstructured":"Cantone, D., Zarba, C.G., Ruggeri-Cannata, R.: A tableau-based decision procedure for a fragment of set theory with iterated membership. Journal of Automated Reasoning\u00a034(1), 49\u201372 (2005)","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1017\/S0960129598002680","volume":"9","author":"G. Dowek","year":"1999","unstructured":"Dowek, G.: Collections, sets and types. Mathematical Structures in Computer Science\u00a09(1), 109\u2013123 (1999)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1006437704595","volume":"26","author":"W.M. Farmer","year":"2001","unstructured":"Farmer, W.M.: Stmm: A set theory for mechanized mathematics. J. Autom. Reasoning\u00a026(3), 269\u2013289 (2001)","journal-title":"J. Autom. Reasoning"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0105405","volume-title":"Theorem Proving in Higher Order Logics","author":"M.J.C. Gordon","year":"1996","unstructured":"Gordon, M.J.C.: Set theory, higher order logic or both? In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol.\u00a01125, pp. 191\u2013201. Springer, Heidelberg (1996)"},{"issue":"1","key":"19_CR11","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":"19_CR12","volume-title":"Introduction to Higher Order Categorial Logic","author":"J. Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.: Introduction to Higher Order Categorial Logic. Cambridge University Press, Cambridge (1986)"},{"key":"19_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4872-9","volume-title":"Mathematics, Form and Function","author":"S.M. Lane","year":"1986","unstructured":"Lane, S.M.: Mathematics, Form and Function. Springer, Heidelberg (1986)"},{"key":"19_CR14","unstructured":"Meng, J.: Integration of interactive and automatic provers. In: Carro, M., Correas, J. (eds.) Second CologNet Workshop on Implementation Technology for Computational Logic Systems (2003), http:\/\/www.cl.cam.ac.uk\/users\/jm318\/papers\/integration.pdf"},{"key":"19_CR15","volume-title":"Handbook of Logic in Computer Science","author":"B. Nordstr\u00f6m","year":"2000","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.: Martin-l\u00f6f\u2019s type theory. In: Abramsky, S., et al. (eds.) Handbook of Logic in Computer Science, vol.\u00a05, Oxford University Press, Oxford (2000)"},{"issue":"2","key":"19_CR16","first-page":"167","volume":"15","author":"L.C. Paulson","year":"1995","unstructured":"Paulson, L.C.: Set Theory for Verification: II. Induction and Recursion\u00a015(2), 167\u2013215 (1995)","journal-title":"Induction and Recursion"},{"key":"19_CR17","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":"19_CR18","volume-title":"Automated Development of Fundamental Mathematical Theories","author":"A. Quaife","year":"1992","unstructured":"Quaife, A.: Automated Development of Fundamental Mathematical Theories. Kluwer Academic Publishers, Norwell (1992)"},{"key":"19_CR19","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":"19_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-45744-5_29","volume-title":"Automated Reasoning","author":"A. Riazanov","year":"2001","unstructured":"Riazanov, A., Voronkov, A.: Vampire 1.1 (system description). In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 376\u2013380. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/S0304-3975(01)00123-2","volume":"266","author":"R. Turner","year":"2001","unstructured":"Turner, R.: Type inference for set theory. Theor. Comput. Sci.\u00a0266(1-2), 951\u2013974 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR22","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","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:32Z","timestamp":1605644072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11814771_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}