{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:27Z","timestamp":1760202507350,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319627","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"326-334","source":"Crossref","is-referenced-by-count":21,"title":["A computational interpretation of open induction"],"prefix":"10.1109","author":[{"given":"U.","family":"Berger","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","volume":"306","author":"luckhardt","year":"1973","journal-title":"Extensional Go?del Functional Interpretation - A Consistency Proof of Classical Analysis Volume 306 of Lecture Notes in Mathematics"},{"key":"17","first-page":"101","article-title":"Interpretation of analysis by means of constructive functionals of finite types","author":"kreisel","year":"1959","journal-title":"Constructive in Mathematics"},{"journal-title":"Countable Choice and 'Quote'","year":"2002","author":"krivine","key":"18"},{"key":"15","first-page":"81","article-title":"Countable functionals","author":"kleene","year":"1959","journal-title":"Constructive in Mathematics"},{"key":"16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0168-0072(01)00077-X","article-title":"On uniform weak Ko?nig's lemma","volume":"114","author":"kohlenbach","year":"2002","journal-title":"Annals of Pure and Applied Logic"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/059"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2307\/2270450"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103100"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1746-8361.1958.tb01464.x"},{"key":"21","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","article-title":"On well-quasi-ordering finite trees","volume":"59","author":"nash-williams","year":"1963","journal-title":"Proc Cambridge Phil Soc"},{"key":"20","article-title":"An induction principle over real numbers","author":"mahboubi","year":"2004","journal-title":"Archive for Mathematical Logic"},{"key":"22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0098600","volume":"811","author":"normann","year":"1980","journal-title":"Recursion on the Countable Functionals Volume 811 of Lecture Notes in Mathematics"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90126-3"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2566-9_13"},{"key":"26","first-page":"169","article-title":"Outline of a mathematical theory of computation","author":"scott","year":"1970","journal-title":"4th Annual Princeton Conference on Information Sciences and Systems"},{"key":"27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/pspum\/005\/0154801","article-title":"Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles in current intuitionistic mathematics","volume":"5","author":"spector","year":"1962","journal-title":"Recursive Function Theory Proceedings Symposium in Pure Mathematics"},{"key":"28","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0066739","volume":"344","author":"troelstra","year":"1973","journal-title":"Metamathematical Investigation of Intuitionistic Arithmetic and Analysis Volume 344 of Lecture Notes in Mathematics"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71264-3"},{"key":"3","article-title":"Modified bar recursion and classical dependent choice","author":"berger","year":"0","journal-title":"Logic Colloquium 2001"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.2307\/2586854"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022549"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(98)80020-7"},{"journal-title":"A Note on the Open Induction Principle","year":"1997","author":"coquand","key":"7"},{"key":"6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BFb0021089","article-title":"Constructive toplogy and combinators","volume":"613","author":"coquand","year":"1991","journal-title":"Constructivity in Computer Science Volume 613 of Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s001530050167"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00073-2"},{"key":"9","first-page":"455","article-title":"Model C of partial continuous functional","author":"ershov","year":"1977","journal-title":"Logic Colloquium 1976"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02025118"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319627.pdf?arnumber=1319627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T05:27:01Z","timestamp":1545370021000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319627\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319627","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}