{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:57:05Z","timestamp":1725857825423},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319402284"},{"type":"electronic","value":"9783319402291"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40229-1_1","type":"book-chapter","created":{"date-parts":[[2016,6,11]],"date-time":"2016-06-11T12:54:04Z","timestamp":1465649644000},"page":"3-8","source":"Crossref","is-referenced-by-count":0,"title":["A Logical Framework for Developing and Mechanizing Set Theories"],"prefix":"10.1007","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,12]]},"reference":[{"key":"1_CR1","series-title":"Applied Logic Series","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-94-017-0253-9_7","volume-title":"Thirty Five Years of Automating Mathematics","author":"A Avron","year":"2003","unstructured":"Avron, A.: Transitive closure and the mechanization of mathematics. In: Kamareddine, F.D. (ed.) Thirty Five Years of Automating Mathematics. Applied Logic Series, pp. 149\u2013171. Springer, Heidelberg (2003)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3119, pp. 32\u201343. Springer, Heidelberg (2004)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-78127-1_6","volume-title":"Pillars of Computer Science","author":"A Avron","year":"2008","unstructured":"Avron, A.: A framework for formalizing set theories based on the use of static set terms. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 87\u2013106. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Avron, A.: A new approach to predicative set theory. In: Schindler, R. (ed.) Ways of Proof Theory. Onto Series in Mathematical Logic, pp. 31\u201363. onto Verlag (2010)","key":"1_CR4","DOI":"10.1515\/9783110324907.31"},{"issue":"1","key":"1_CR5","first-page":"53","volume":"9","author":"A Avron","year":"2016","unstructured":"Avron, A., Cohen, L.: Formalizing scientifically applicable mathematics in a definitional framework. J. Formalized Reasoning 9(1), 53\u201370 (2016)","journal-title":"J. Formalized Reasoning"},{"unstructured":"Avron, A., Cohen, L.: A minimal framework for applicable mathematics (to appear, 2016)","key":"1_CR6"},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3452-2","volume-title":"Set Theory for Computing: From Decision Procedures to Declarative Programming With Sets","author":"D Cantone","year":"2001","unstructured":"Cantone, D., Omodeo, E., Policriti, A.: Set Theory for Computing: From Decision Procedures to Declarative Programming With Sets. Springer, New York (2001)"},{"key":"1_CR8","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21723-8","volume-title":"Constructibility","author":"K Devlin","year":"1984","unstructured":"Devlin, K.: Constructibility. Perspectives in Mathematical Logic. Springer, Heidelberg (1984)"},{"unstructured":"Feferman, S.: Weyl vindicated: Das kontinuum 70 years later. Termi e prospettive della logica e della filosofia della scienza contemporanee, vol. 1 (1988)","key":"1_CR9"},{"key":"1_CR10","volume-title":"Foundations of Set Theory","author":"AA Fraenkel","year":"1973","unstructured":"Fraenkel, A.A., Bar-Hillel, Y., Levy, A.: Foundations of Set Theory. Elsevier, Amsterdam (1973)"},{"doi-asserted-by":"crossref","unstructured":"Gandy, R.O.: Set-theoretic functions for elementary syntax. In: Proceedings of the Symposium in Pure Mathematics, vol. 13, pp. 103\u2013126 (1974)","key":"1_CR11","DOI":"10.1090\/pspum\/013.2\/0376348"},{"key":"1_CR12","first-page":"51","volume":"18","author":"S Kieffer","year":"2009","unstructured":"Kieffer, S., Avigad, J., Friedman, H.: A language for mathematical language management. Stud. Logic Grammar Rhetoric 18, 51\u201366 (2009)","journal-title":"Stud. Logic Grammar Rhetoric"},{"key":"1_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02308-2","volume-title":"Basic Set Theory. Perspectives in Mathematical Logic","author":"A Levy","year":"1979","unstructured":"Levy, A.: Basic Set Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1979)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40229-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:12:42Z","timestamp":1498320762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40229-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319402284","9783319402291"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40229-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}