{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:53:59Z","timestamp":1743116039502,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_23","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"299-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Refuting Learning Revisited"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Merkle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.2307\/2275058","volume":"56","author":"L. M. Adleman","year":"1991","unstructured":"Leonard M. Adleman and Manuel Blum: Inductive inference and unsolvability. The Journal of Symbolic Logic, 56:891\u2013900, 1991.","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR2","unstructured":"J. Richard B\u00fcchi: On a decision method in restricted second order arithmetic. Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, Standford University Press, Standford, California, 1960."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Heinz-Dieter Ebbinghaus, J\u00f6rg Flum and Wolfgang Thomas: Mathematical Logic, Springer, 1994.","DOI":"10.1007\/978-1-4757-2355-7"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2275176","volume":"57","author":"W. I. Gasarch","year":"1992","unstructured":"William I. Gasarch, Mark G. Pleszkoch and Robert Solovay: Learning via queries in [+,<]. The Journal of Symbolic Logic, 57:53\u201381, 1992.","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1145\/146637.146670","volume":"39","author":"W. I. Gasarch","year":"1992","unstructured":"William I. Gasarch and Carl H. Smith: Learning via queries, Journal of the Association of Computing Machinery, 39:649\u2013674, 1992.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00269958","volume":"22","author":"C. Glymour","year":"1985","unstructured":"Clark Glymour: Inductive Inference in the limit. Erkenntnis 22:23\u201331, 1985.","journal-title":"Erkenntnis"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. Mark Gold: Language identification in the limit. Information and Control, 10: 447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"23_CR8","unstructured":"Gunter Grieser: Reflexion in der Induktiven Inferenz. Diploma Thesis, Technische Hochschule Leipzig, 1996."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Gunter Grieser: Reflecting Inductive Inference Machines and its Improvement by Therapy. Seventh Annual International Workshop on Algorithmic Learning Theory (ALT), Lecture Notes in Artificial Intelligence 1160:325\u2013336, Springer, 1996.","DOI":"10.1007\/3-540-61863-5_56"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jcss.1998.1591","volume":"57","author":"S. Jain","year":"1998","unstructured":"Sanjay Jain: Learning with refutation. Journal of Computer and Systems Sciences, 57:356\u2013365, 1998.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"23_CR11","unstructured":"Sanjay Jain, Efim Kinber, Rolf Wiehagen, Thomas Zeugmann: On learning of functions refutably, Theoretical Computer Science, to appear."},{"key":"23_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn","author":"S. Jain","year":"1999","unstructured":"Sanjay Jain, Daniel Osherson, James Royer and Arun Sharma: Systems that Learn, revised edition of [25]. The MIT Press, Cambridge, Massachusetts, 1999."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/inco.1996.2614","volume":"132","author":"S. Jain","year":"1997","unstructured":"Sanjay Jain and Arun Sharma: Elementary formal systems, intrinsic complexity and procrastination. Information and Computation, 132:65\u201384, 1997.","journal-title":"Information and Computation"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Klaus-Peter Jantke: Reflecting and self-confident inductive inference machines. Sixth Annual International Workshop on Algorithmic Learning Theory (ALT), Lecture Notes in Artificial Intelligence 997:282\u2013297, Springer, 1995.","DOI":"10.1007\/3-540-60454-5_46"},{"key":"23_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195091953.001.0001","volume-title":"The Logic of Reliable Inquiry","author":"K. T. Kelly","year":"1996","unstructured":"Kevin T. Kelly: The Logic of Reliable Inquiry. Oxford University Press, New York, 1996."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF00260743","volume":"21","author":"K. T. Kelly","year":"1992","unstructured":"Kevin T. Kelly and Clark Glymour: Inductive inference from theory-laden data. Journal of Philosophical Logic, 21:391\u2013444, 1992.","journal-title":"Journal of Philosophical Logic"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Steffen Lange and Phil Watson: Machine discovery in the presence of incomplete or ambiguous data. Joint Proceedings of the Fourth International Workshop on Analogical and Inductive Inference (AII) and of the Fifth Workshop on Algorithmic Learning Theory (ALT), Lecture Notes in Artificial Intelligence 872:438\u2013452, Springer, 1994.","DOI":"10.1007\/3-540-58520-6_82"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.2307\/2275647","volume":"62","author":"E. Martin","year":"1997","unstructured":"Eric Martin and Daniel N. Osherson: Scientific discovery based on belief revision. The Journal of Symbolic Logic, 62:1352\u20131370, 1997.","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR19","volume-title":"Elements of Scientific Inquiry","author":"E. Martin","year":"1998","unstructured":"Eric Martin and Daniel N. Osherson: Elements of Scientific Inquiry. The MIT Press, Cambridge, Massachusetts, 1998."},{"key":"23_CR20","unstructured":"Eric Martin, Arun Sharma and Frank Stephan: Learning Power and Language Expressiveness. Forschungsbericht Mathematische Logik 49, Mathematisches Institut, Universit\u00e4t Heidelberg, Heidelberg, 2000."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"Eliana Minicozzi. Some natural properties of strong-identification in inductive inference. Theoretical Computer Science, 2:345\u2013360, 1976.","journal-title":"Theoretical Computer Science"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Yasuhito Mukouchi and Setsuo Arikawa: Inductive inference machines that can refute hypothesis spaces. Fourth Annual International Workshop on Algorithmic Learning Theory (ALT), Lecture Notes in Artificial Intelligence 744:123\u2013136, Springer, 1993.","DOI":"10.1007\/3-540-57370-4_42"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","volume":"137","author":"Y. Mukouchi","year":"1995","unstructured":"Yasuhito Mukouchi and Setsuo Arikawa: Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science, 137:53\u201384, 1995.","journal-title":"Theoretical Computer Science"},{"key":"23_CR24","unstructured":"Piergiorgio Odifreddi: Classical Recursion Theory, Volumes I and II. North Holland and Elsevier, Amsterdam, 1989 and 1999."},{"key":"23_CR25","volume-title":"An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"Daniel Osherson, Michael Stob and Scott Weinstein: Systems That Learn. An Introduction to Learning Theory for Cognitive and Computer Scientists. Bradford \u2014 The MIT Press, Cambridge, Massachusetts, 1986."},{"key":"23_CR26","unstructured":"Mojzesz Presburger: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik der ganzen Zahlen in welchem die Addition als einzige Operation hervortritt. C. R. 1 erCongr\u00e8s des Math\u00e9maticiens des Pays Slaves (Warsaw) 92\u2013101, 395, 1930."},{"key":"23_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2964057","volume":"22","author":"H. Putnam","year":"1957","unstructured":"Hilary Putnam: Decidability and essential undecidability. The Journal of Symbolic Logic, 22:39\u201354, 1957.","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"Takeshi Shinohara: Inductive inference of monotonic formal systems from positive data. New Generation Computing, 8:371\u2013384, 1991.","journal-title":"New Generation Computing"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Craig Smory\u0144ski: Logical Number Theory I. An Introduction. Springer, 1991.","DOI":"10.1007\/978-3-642-75462-3"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Robert I. Soare: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Springer, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas: Automata on Infinite Objects. Handbookof Theoretical Computer Science, Vol. B, edited by Jan van Leeuwen, p. 133\u2013191, Elsevier, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Wolfgang Thomas: Classifying regular events in symbolic logic, Journal of Computer and System Sciences, 25:360\u2013376, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/3-540-56503-5_60","volume-title":"Locally threshold testable languages of infinite words","author":"T. Wilke","year":"1993","unstructured":"Thomas Wilke: Locally threshold testable languages of infinite words. Tenth Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 665:607\u2013616, Springer, 1993."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:53:53Z","timestamp":1708268033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}