{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:23:35Z","timestamp":1743092615555,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_17","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"215-229","source":"Crossref","is-referenced-by-count":6,"title":["A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Berardi","sequence":"first","affiliation":[]},{"given":"Ugo","family":"de\u2019Liguoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An arithmetical hierarchy of the law of excluded middle and related principles. In: Proc. of LICS 2004, pp. 192\u2013201 (2004)","DOI":"10.1109\/LICS.2004.1319613"},{"key":"17_CR2","unstructured":"Berardi, S., de\u2019 Liguoro, U.: A Calculus of Realizers for EM1 Arithmetic (Full Version). Technical report, Universit\u00e0 di Torino (2008), http:\/\/www.di.unito.it\/~stefano\/RealWFA.pdf"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.2307\/2275524","volume":"60","author":"T. Coquand","year":"1995","unstructured":"Coquand, T.: A semantics of evidence for classical arithmetic. J. Symb. Log.\u00a060, 325\u2013337 (1995)","journal-title":"J. Symb. Log."},{"issue":"1","key":"17_CR4","first-page":"5","volume":"9","author":"G. Criscuolo","year":"1975","unstructured":"Criscuolo, G., Minicozzi, E., Trautteur, G.: Limiting recursion and the arithmetic hierarchy. ITA\u00a09(1), 5\u201312 (1975)","journal-title":"ITA"},{"key":"17_CR5","series-title":"LNM","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0103100","volume-title":"Higher Set Theory","author":"H. Friedman","year":"1978","unstructured":"Friedman, H.: Classically and intuitionistically provably recursive functions. In: Scott, D.S., Muller, G.H. (eds.) Higher Set Theory. LNM, vol.\u00a0699, pp. 21\u201328. Springer, Heidelberg (1978)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E.M. Gold","year":"1965","unstructured":"Gold, E.M.: Limiting recursion. J. Symb. Log.\u00a030, 28\u201348 (1965)","journal-title":"J. Symb. Log."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/96709.96714","volume-title":"Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL 1990","author":"T.G. Griffin","year":"1990","unstructured":"Griffin, T.G.: The formulae-as-types notion of control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL 1990, San Francisco, CA, USA, January 17\u201319, pp. 47\u201357. ACM Press, New York (1990)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2005.10.019","volume":"350","author":"S. Hayashi","year":"2006","unstructured":"Hayashi, S.: Mathematics based on incremental learning, excluded middle and inductive inference. Theor. Comp. Sci.\u00a0350, 125\u2013139 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86896-2","volume-title":"Grundlagen der Mathematik","author":"D. Hilbert","year":"1970","unstructured":"Hilbert, D., Bernays, P.: Grundlagen der Mathematik, vol.\u00a0II. Springer, Heidelberg (1970)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0304-3975(02)00776-4","volume":"308","author":"J.-L. Krivine","year":"2003","unstructured":"Krivine, J.-L.: Dependent choice, \u2018quote\u2019 and the clock. Theor. Comput. Sci.\u00a0308, 259\u2013276 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.2307\/2275811","volume":"61","author":"G. Mints","year":"1996","unstructured":"Mints, G.: Strong termination for the epsilong substitution method. J. Symb. Log.\u00a061(4), 1193\u20131205 (1996)","journal-title":"J. Symb. Log."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11225-006-6610-7","volume":"82","author":"G. Moser","year":"2006","unstructured":"Moser, G., Zach, R.: The epsilon calculus and herbrand complexity. Studia Logica\u00a082(1), 133\u2013155 (2006)","journal-title":"Studia Logica"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Murthy, C.R.: An evaluation semantics for classical proofs. In: Proc. of LICS 1991, pp. 96\u2013107 (1991)","DOI":"10.1109\/LICS.1991.151634"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Parigot, M.: Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In: LPAR, pp. 190\u2013201 (1992)","DOI":"10.1007\/BFb0013061"},{"issue":"3","key":"17_CR15","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1145\/321832.321841","volume":"21","author":"L.K. Schubert","year":"1974","unstructured":"Schubert, L.K.: Iterated limiting recursion and the program minimalization problem. J. of Ass. Comp. Mach.\u00a021(3), 436\u2013445 (1974)","journal-title":"J. of Ass. Comp. Mach."},{"key":"17_CR16","volume-title":"Constructivism in Mathematics","author":"D. van Dalen","year":"1988","unstructured":"van Dalen, D., Troelstra, A.: Constructivism in Mathematics, vol.\u00a0I. North-Holland, Amsterdam (1988)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:04:30Z","timestamp":1738350270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}