{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T12:14:19Z","timestamp":1768479259887,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276538","type":"print"},{"value":"9783642276545","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27654-5_10","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T13:46:33Z","timestamp":1329313593000},"page":"120-139","source":"Crossref","is-referenced-by-count":9,"title":["Learning Families of Closed Sets in Matroids"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"10_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-69902-6_23","volume-title":"New Frontiers in Artificial Intelligence","author":"M. Brecht de","year":"2007","unstructured":"de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of Closed Set Systems from Positive Data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol.\u00a04384, pp. 265\u2013275. Springer, Heidelberg (2007)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.ic.2009.08.001","volume":"208","author":"M. Brecht de","year":"2010","unstructured":"de Brecht, M., Yamamoto, A.: Topological properties of concept spaces. Information annd Computation\u00a0208, 327\u2013340 (2010)","journal-title":"Information annd Computation"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90331-U","volume":"87","author":"C.S. Calude","year":"1991","unstructured":"Calude, C.S.: Relativized topological size of sets of partial recursive functions. Theoretical Computer Science\u00a087, 347\u2013352 (1991)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness - An Algorithmic Perspective","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness - An Algorithmic Perspective, 2nd edn. Springer, Heidelberg (2002)","edition":"2"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1006\/jcss.2000.1736","volume":"62","author":"J. Case","year":"2001","unstructured":"Case, J., Jain, S.: Synthesizing learners tolerating computable noisy data. Journal of Computer and System Sciences\u00a062, 413\u2013441 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Automata, Languages, and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine Inductive Inference and Language Identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.H.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science\u00a025, 193\u2013220 (1983)","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M. Fulk","year":"1990","unstructured":"Fulk, M.: Prudence and other conditions on formal language learning. Information and Computation\u00a085, 1\u201311 (1990)","journal-title":"Information and Computation"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0168-0072(96)00029-2","volume":"87","author":"M.J. Groszek","year":"1997","unstructured":"Groszek, M.J., Slaman, T.A.: $\\Pi^0_1$ classes and minimal degrees. Annals of Pure and Applied Logic\u00a087, 117\u2013144 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Mark Gold","year":"1967","unstructured":"Mark Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jcss.2006.09.001","volume":"73","author":"V.S. Harizanov","year":"2007","unstructured":"Harizanov, V.S., Stephan, F.: On the learnability of vector spaces. Journal of Computer and System Sciences\u00a073, 109\u2013122 (2007)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems That Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems That Learn: An Introduction to Learning Theory, 2nd edn. MIT-Press, Boston (1999)","edition":"2"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.4153\/CJM-1972-113-9","volume":"24","author":"C. Jockusch","year":"1972","unstructured":"Jockusch, C.: Degrees in which recursive sets are uniformly recursive. Canadian Journal of Mathematics\u00a024, 1092\u20131099 (1972)","journal-title":"Canadian Journal of Mathematics"},{"key":"10_CR15","first-page":"33","volume":"173","author":"C. Jockusch","year":"1972","unstructured":"Jockusch, C., Soare, R.: $\\Pi^0_1$ classes and degrees of theories. Transactions of the American Mathematical Society\u00a0173, 33\u201356 (1972)","journal-title":"Transactions of the American Mathematical Society"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"481","DOI":"10.2307\/2271869","volume":"42","author":"I. Kalantari","year":"1977","unstructured":"Kalantari, I., Retzlaff, A.: Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces. The Journal of Symbolic Logic\u00a042, 481\u2013491 (1977)","journal-title":"The Journal of Symbolic Logic"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-13089-2_32","volume-title":"Language and Automata Theory and Applications","author":"A. Kasprzik","year":"2010","unstructured":"Kasprzik, A., K\u00f6tzing, T.: String Extension Learning Using Lattices. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 380\u2013391. Springer, Heidelberg (2010)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0003-4843(77)90015-8","volume":"11","author":"G. Metakides","year":"1977","unstructured":"Metakides, G., Nerode, A.: Recursively enumerable vector spaces. Annals of Mathematical Logic\u00a011, 147\u2013171 (1977)","journal-title":"Annals of Mathematical Logic"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0021-8693(80)90237-9","volume":"65","author":"G. Metakides","year":"1980","unstructured":"Metakides, G., Nerode, A.: Recursion theory on fields and abstract dependence. Journal of Algebra\u00a065, 36\u201359 (1980)","journal-title":"Journal of Algebra"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"Minicozzi, E.: Some natural properties of strong-identification in inductive inference. Theoretical Computer Science\u00a02, 345\u2013360 (1976)","journal-title":"Theoretical Computer Science"},{"key":"10_CR21","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. North-Holland, Amsterdam (1989)"},{"key":"10_CR22","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory II. Studies in Logic and the Foundations of Mathematics, vol.\u00a0143. Elsevier, Amsterdam (1999)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Osherson, D.N., Stob, M., Weinstein, S.: Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press (1986)","DOI":"10.7551\/mitpress\/6609.001.0001"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"Osherson, D., Weinstein, S.: Criteria of language learning. Information and Control\u00a052, 123\u2013138 (1982)","journal-title":"Information and Control"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1142\/9789812796554_0014","volume":"15","author":"A. Raichev","year":"2008","unstructured":"Raichev, A., Stephan, F.: A minimal rK-degree. Computational Prospects of Infinity, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore\u00a015, 261\u2013269 (2008)","journal-title":"Computational Prospects of Infinity, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore"},{"key":"10_CR26","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"10_CR27","volume-title":"Perspectives in Mathematical Logic","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. In: Perspectives in Mathematical Logic, Springer, Berlin (1987)"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(00)00272-3","volume":"268","author":"F. Stephan","year":"2001","unstructured":"Stephan, F., Ventsov, Y.: Learning algebraic structures from text. Theoretical Computer Science\u00a0268, 221\u2013273 (2001)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computation, Physics and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27654-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T13:12:17Z","timestamp":1593695537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27654-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276538","9783642276545"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27654-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}