{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T21:35:57Z","timestamp":1770413757119,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642226724","type":"print"},{"value":"9783642226731","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22673-1_20","type":"book-chapter","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T07:49:15Z","timestamp":1310543355000},"page":"278-280","source":"Crossref","is-referenced-by-count":1,"title":["Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Asperti","sequence":"first","affiliation":[]},{"given":"Maria Emilia","family":"Maietti","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Sambin","sequence":"additional","affiliation":[]},{"given":"Silvio","family":"Valentini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A., Avigad, J.: Zen and the art of formalization. Mathematical Structures in Computer Science 21 (to appear, 2011)","DOI":"10.1017\/S0960129511000065"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10817-007-9070-5","volume":"39","author":"A. Asperti","year":"2007","unstructured":"Asperti, A., Coen, C.S., Tassi, E., Zacchiroli, S.: User interaction with the Matita proof assistant. Journal of Automated Reasoning\u00a039(2), 109\u2013139 (2007)","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ciraulo, F., Maietti, M.E., Toto, P.: Constructive version of Boolean Algebra. IGPL (to appear, 2011)","DOI":"10.1093\/jigpal\/jzs021"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1016\/j.jpaa.2010.02.002","volume":"214","author":"F. Ciraulo","year":"2010","unstructured":"Ciraulo, F., Sambin, G.: The overlap algebra of regular opens. Journal of Pure and Applied Algebra\u00a0214, 1988\u20131995 (2010)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129510000320","volume":"21","author":"C.S. Coen","year":"2011","unstructured":"Coen, C.S., Tassi, E.: Formalizing Overlap Algebras in Matita. Mathematical Structures in Computer Science\u00a021, 1\u201331 (2011)","journal-title":"Mathematical Structures in Computer Science"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Coen, C.S., Valentini, S.: General recursion and formal topology. In: Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers. EPTCS, vol.\u00a043, pp. 65\u201375 (2010)","DOI":"10.4204\/EPTCS.43.5"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.apal.2009.01.006","volume":"160","author":"M.E. Maietti","year":"2009","unstructured":"Maietti, M.E.: A minimalist two-level foundation for constructive mathematics. Annals of Pure and Applied Logic\u00a0160(3), 319\u2013354 (2009)","journal-title":"Annals of Pure and Applied Logic"},{"key":"20_CR8","volume-title":"Toward A Minimalist Foundation for Constructive Mathematics, ch. 6","author":"M.E. Maietti","year":"2005","unstructured":"Maietti, M.E., Sambin, G.: From Sets and Types to Topology and Analysis. In: Toward A Minimalist Foundation for Constructive Mathematics, ch. 6. Oxford University Press, Oxford (2005)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Valentini, S.: Cantor theorem and friends, in logical form. Annals of Pure and Applied Logic 163 (to appear, 2011)","DOI":"10.1016\/j.apal.2011.06.023"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22673-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:19:42Z","timestamp":1560367182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22673-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226724","9783642226731"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22673-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}