{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:45Z","timestamp":1755220965295,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":["Studia Logica"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1023\/a:1026455720278","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T11:45:40Z","timestamp":1068119140000},"page":"243-268","source":"Crossref","is-referenced-by-count":1,"title":["Paradigms in Measure Theoretic Learning and in Informant Learning"],"prefix":"10.1007","volume":"62","author":[{"given":"Franco","family":"Montagna","sequence":"first","affiliation":[]},{"given":"Giulia","family":"Simi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"205536_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"[. 8. D. Angluin","year":"1980","unstructured":"[An 80] D. Angluin, \u2018Inductive inference of formal languages from positive data\u2019, Inform. Control 45(2) 1980, 117\u2013135.","journal-title":"Inform. Control"},{"key":"205536_CR2","unstructured":"[An 88] D. Angluin, Identifying languages from stochastic examples, Technical Report 614, University of Yale, 1988."},{"issue":"2","key":"205536_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"[. 7. L. Blum","year":"1975","unstructured":"[BB 75] L. Blum and M. Blum, \u2018Toward a mathematical theory of inductive inference\u2019, Inform. Control 28(2) (1975), 125\u2013155.","journal-title":"Inform. Control"},{"key":"205536_CR4","unstructured":"[B 86] P. Billingsey, Probability and Measure, John Wiley and Sons, second edition 1986."},{"key":"205536_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"[. 8. J. Case","year":"1983","unstructured":"[CS 83] J. Case, C. Smith, \u2018Comparison of identification criteria for machine inductive inference\u2019, Theoretical Computer Science 25, (1983), 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"205536_CR6","first-page":"193","volume-title":"Proceedings of COLT 1996, Desenzano sul Garda","author":"[. 9. D. De Jongh","year":"1996","unstructured":"[DJK 96] D. De Jongh, M. Kanazawa, \u2018Angluin's theorem for indexed classes of r.e. languages and applications\u2019, Proceedings of COLT 1996, Desenzano sul Garda, ACM, New York 1996, 193\u2013204."},{"key":"205536_CR7","volume-title":"Handbook of Logic and Language","author":"[. 9. D. De Jongh","year":"1996","unstructured":"[DMOWS 96] D. De Jongh, E. Martin, D. Osherson, S. Weinstein, \u2018A first order framework for learning\u2019, J. van Benthem, A. ter Meulen (eds.), Handbook of Logic and Language, Elsevier Science Publishers, New York 1996."},{"key":"205536_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"[. E. M. Gold","year":"1967","unstructured":"[G65] E. M. Gold, \u2018Language identification in the limit\u2019, Inform. Control 10 (1967), 447\u2013474.","journal-title":"Inform. Control"},{"key":"205536_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02308-2","volume-title":"Basic Set Theory","author":"[. A. Levy","year":"1979","unstructured":"[L79] A. Levy, Basic Set Theory, Springer Verlag, Berlin 1979."},{"key":"205536_CR10","unstructured":"[Mo 96] F. Montagna, \u2018Investigations in measure-one identification of classes of languages\u2019, preprint, University of Siena 1996, to appear in Information and Computation."},{"key":"205536_CR11","volume-title":"Classical Recursion Theory","author":"[. 8. P. Odifreddi","year":"1989","unstructured":"[Od 89] P. Odifreddi, Classical Recursion Theory, North Holland, Amsterdam 1989."},{"key":"205536_CR12","unstructured":"[Od?] P. Odifreddi, Classical Recursion Theory. Vol. II, book in preparation."},{"key":"205536_CR13","volume-title":"Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"[. 8. D. Osherson","year":"1986","unstructured":"[OSW 86] D. Osherson, M. Stob, S. Weinstein, Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists, MIT Press, Cambridge, MA 1986."},{"key":"205536_CR14","unstructured":"[P 85] L. Pitt, \u2018Probabilistic inductive inference\u2019, PhD thesis, Yale University 1985."},{"issue":"2","key":"205536_CR15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","volume":"36","author":"[. 8. L. Pitt","year":"1989","unstructured":"[P 89] L. Pitt, \u2018Probabilistic inductive inference\u2019, J. ACM 36(2) (1989), 383\u2013433.","journal-title":"J. ACM"},{"key":"205536_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","volume":"77","author":"[. 8. L. Pitt","year":"1988","unstructured":"[PS 88] L. Pitt, C. Smith, \u2018Probability and plurality for aggregations of learning machines\u2019, Information and Computation 77 (1988), 77\u201392.","journal-title":"Information and Computation"},{"key":"205536_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"[. 6. H. Rogers","year":"1967","unstructured":"[R 67] H. Rogers, Theory of Recursive Functions and Effective Computability, Mc Graw Hill, New York 1967."},{"key":"205536_CR18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(83)90067-1","volume":"28","author":"[. 8. R. Wiehagen","year":"1984","unstructured":"[WFK 84] R. Wiehagen, R. Friewalds, E. Kinber, \u2018On the power of probabilistic strategies in inductive inference\u2019, Theoretical Computer Science 28 (1984), 111\u2013133.","journal-title":"Theoretical Computer Science"},{"key":"205536_CR19","doi-asserted-by":"crossref","unstructured":"[ZL 95] T. Zeugmann, S. Lange, \u2018A guided tour across the boundaries of learning recursive languages\u2019, in Algoritmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence 961, p. 193\u2013262, Springer Verlag 1995.","DOI":"10.1007\/3-540-60217-8_12"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026455720278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026455720278\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026455720278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:21:03Z","timestamp":1754630463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026455720278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["205536"],"URL":"https:\/\/doi.org\/10.1023\/a:1026455720278","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}