{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:40Z","timestamp":1725488980677},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001706"},{"type":"electronic","value":"9783540361695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36169-3_2","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:27:32Z","timestamp":1186878452000},"page":"7-21","source":"Crossref","is-referenced-by-count":5,"title":["Mathematics Based on Learning"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Hayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"2_CR1","unstructured":"Y. Akama and S. Hayashi, Limiting Cartesian Closed Categories, submitted, 2002."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M. Beeson, Foundations ofConstructiv e Mathematics, Springer, 1985","DOI":"10.1007\/978-3-642-68952-9"},{"key":"2_CR3","unstructured":"S. Baratella and S. Berardi, Constructivization via Approximations and Examples, Theories of Types and Proofs, M. Takahashi, M. Okada and M. Dezani-Ciancaglini eds., MSJ Memories 2 (1998) 177\u2013205"},{"key":"2_CR4","unstructured":"S. Berardi, Classical logic as Limit Completion I. Part I: a constructive model for non-recursive maps, submitted, 2001, at http:\/\/www.di.unito.it\/~stefano\/ available."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"D. Bridges and F. Richman, Varieties ofConstructiv e Mathematics, 1987, Cambridge University Press.","DOI":"10.1017\/CBO9780511565663"},{"key":"2_CR6","unstructured":"J. Case and M. Suraj, Inductive Inference of \u22110 1-vs. \u22110 2-Definitions ofComputable Functions, manuscript, 2002."},{"key":"2_CR7","first-page":"47","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Y. Ershov, A hierarchy ofsets I, Alg. Log. 7 (1968) 47\u201374, transl. 7 (1968) 25-43.","journal-title":"Alg. Log."},{"key":"2_CR8","first-page":"15","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Y. Ershov, A hierachy ofsets II, Alg. Log. 7 (1968) 15\u201347, transl. 7 (1968) 212-232.","journal-title":"Alg. Log."},{"key":"2_CR9","first-page":"34","volume":"9","author":"Y. \u0116rshov","year":"1970","unstructured":"Y. \u0116rshov, A hierachy ofsets III, Alg. Log. 9 (1970) 34\u201351, transl. 9 (1970) 20-31.","journal-title":"Alg. Log."},{"key":"2_CR10","unstructured":"S. Hayashi and H. Nakano, PX: A Computational Logic, 1988, The MIT Press, PDF version is available free for charge at http:\/\/www.shayashi.jp\/PXbook.html"},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45842-5_9","volume-title":"Types for Proofs and Programs","author":"S. Hayashi","year":"2001","unstructured":"S. Hayashi and M. Nakata, Towards Limit Computable Mathematics, in Types for Proofs and Programs, P. Challanghan, Z. Luo, J. McKinna, R. Pollack, eds., Springer Lecture Notes in Computer Science 2277 (2001) 125\u2013144"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(00)00350-9","volume":"272","author":"S. Hayashi","year":"2002","unstructured":"S. Hayashi, R. Sumitomo and K. Shii, Towards Animation ofPro ofs-Testing Proofs by Examples-, Theoretical Computer Science, 272 (2002), 177\u2013195","journal-title":"Theoretical Computer Science"},{"key":"2_CR13","unstructured":"U. Kohlenbach, ProofIn terpretations and the Computational Contents ofPro ofs (draft in progress), BRIC, University of Aarhus, available at http:\/\/www.brics.dk\/~kohlenb\/"},{"key":"2_CR14","unstructured":"E. Martin, P. Nguyen, A. Sharma, and F. Stephan, Learning in logic with Rich-Prolog, in Logic Programming 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29\u2013August 1, 2002 Proceedings, Stuckey, P.J. ed., 2002, Springer."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"J. Mitchell, Type systems for programming languages, in Handbook of Theoretical Computer Science, vol.B, van Leeuwen et al. eds., North-Holland, 1990, 365\u2013458","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"2_CR16","first-page":"421","volume":"5","author":"M. Nakata","year":"2001","unstructured":"M. Nakata and S. Hayashi, Realizability Interpretation for Limit Computable Mathematics, Scientiae Mathematicae Japonicae, vol.5 (2001), 421\u2013434.","journal-title":"Scientiae Mathematicae Japonicae"},{"key":"2_CR17","unstructured":"P.G. Odifreddi, Classical Recursion Theory North-Holland, 1989"},{"key":"2_CR18","unstructured":"E.Y. Shapiro, Inductive Inference of Theories from Facts, in Computational Logic: Essays in Honor ofAlan Robinson, Lassez, J.L. and Plotkin, G.D. eds., MIT Press, 199\u2013255, 1991"},{"key":"2_CR19","series-title":"Lect Notes Comput Sci","first-page":"221","volume-title":"Theoretical Computer Science-Series A","author":"F. Stephan","year":"2001","unstructured":"F. Stephan and Y. Ventsov, Learning Algebraic Structures from Text using Semantical Knowledge, in Theoretical Computer Science-Series A, 268:221\u2013273, 2001, Extended Abstract in Proceedings ofthe Ninth Annual Workshop on Algorithmic Learning Theory-ALT 1998, Springer LNCS 1501, 321-335, 1998."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"S.G. Simpson, Subsystems ofSecond Order Arithmetic, Springer, 1999","DOI":"10.1007\/978-3-642-59971-2"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"A. Troelstra, Realizability, in Handbook of Proof Theory, S. Buss (ed.), Elsevier, Amsterdam, 1998, 407\u2013474","DOI":"10.1016\/S0049-237X(98)80021-9"},{"key":"2_CR22","first-page":"405","volume":"5","author":"M. Yasugi","year":"2001","unstructured":"M. Yasugi, V. Brattka, and M. Washihara, Computability aspects ofsome discontinuous functions, 2001, Scientiae Mathematicae Japonicae, vol.5 (2001), 405\u2013419.","journal-title":"Scientiae Mathematicae Japonicae"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36169-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:40:34Z","timestamp":1556739634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36169-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001706","9783540361695"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36169-3_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}