{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T17:26:22Z","timestamp":1744133182796,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723393"},{"type":"electronic","value":"9789819723409"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-2340-9_1","type":"book-chapter","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:01:51Z","timestamp":1714690911000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Learning Families of\u00a0Ideals in\u00a0Lattices and\u00a0Boolean Algebras"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2967-9008","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"issue":"2","key":"1_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. Inf. Control 45(2), 117\u2013135 (1980). https:\/\/doi.org\/10.1016\/S0019-9958(80)90285-5","journal-title":"Inf. Control"},{"key":"1_CR2","unstructured":"Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol.\u00a0144. Elsevier Science B.V., Amsterdam (2000)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Inf. Control 28(2), 125\u2013155 (1975). https:\/\/doi.org\/10.1016\/S0019-9958(75)90261-2","journal-title":"Inf. Control"},{"key":"1_CR4","unstructured":"Cooper, S.B.: Degrees of unsolvability. Ph.D. thesis, Leicester University (1971)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science (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 de Brecht","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. 4384, pp. 265\u2013275. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69902-6_23"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/J.IC.2009.08.001","volume":"208","author":"M de Brecht","year":"2010","unstructured":"de Brecht, M., Yamamoto, A.: Topological properties of concept spaces (full version). Inf. Comput. 208(4), 327\u2013340 (2010). https:\/\/doi.org\/10.1016\/J.IC.2009.08.001","journal-title":"Inf. Comput."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-27654-5_10","volume-title":"Computation, Physics and Beyond","author":"Z Gao","year":"2012","unstructured":"Gao, Z., Stephan, F., Wu, G., Yamamoto, A.: Learning families of closed sets in matroids. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) WTCS 2012. LNCS, vol. 7160, pp. 120\u2013139. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27654-5_10"},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)91165-5","journal-title":"Inf. Control"},{"key":"1_CR9","unstructured":"Goncharov, S.S.: Countable Boolean Algebras and Decidability. Consultants Bureau, New York (1997)"},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: Foundation. Birkh\u00e4user, Basel (2011)"},{"issue":"1\u20133","key":"1_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0168-0072(97)00056-0","volume":"93","author":"VS Harizanov","year":"1998","unstructured":"Harizanov, V.S.: Turing degrees of certain isomorphic images of computable relations. Ann. Pure Appl. Logic 93(1\u20133), 103\u2013113 (1998). https:\/\/doi.org\/10.1016\/S0168-0072(97)00056-0","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jcss.2006.09.001","volume":"73","author":"VS Harizanov","year":"2007","unstructured":"Harizanov, V.S., Stephan, F.: On the learnability of vector spaces. J. Comput. Syst. Sci. 73(1), 109\u2013122 (2007). https:\/\/doi.org\/10.1016\/j.jcss.2006.09.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1016\/j.apal.2016.06.002","volume":"167","author":"R H\u00f6lzl","year":"2016","unstructured":"H\u00f6lzl, R., Jain, S., Stephan, F.: Inductive inference and reverse mathematics. Ann. Pure Appl. Logic 167(12), 1242\u20131266 (2016). https:\/\/doi.org\/10.1016\/j.apal.2016.06.002","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn","author":"S Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn. MIT Press, Cambridge (1999)"},{"key":"1_CR15","volume-title":"Handbook of Boolean Algebras","author":"S Koppelberg","year":"1989","unstructured":"Koppelberg, S.: Handbook of Boolean Algebras, vol. 1. North-Holland, Amsterdam (1989)"},{"issue":"1\u20133","key":"1_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.tcs.2008.02.030","volume":"397","author":"S Lange","year":"2008","unstructured":"Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: a survey. Theor. Comput. Sci. 397(1\u20133), 194\u2013232 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.02.030","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. Elsevier Science B.V., Amsterdam (1992)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H Putnam","year":"1965","unstructured":"Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. J. Symb. Log. 30(1), 49\u201357 (1965). https:\/\/doi.org\/10.2307\/2270581","journal-title":"J. Symb. Log."},{"key":"1_CR19","first-page":"1097","volume-title":"Handbook of Boolean Algebras","author":"JB Remmel","year":"1989","unstructured":"Remmel, J.B.: Recursive Boolean algebras. In: Monk, J.D., Bonnet, R. (eds.) Handbook of Boolean Algebras, vol. 3, pp. 1097\u20131165. North-Holland, Amsterdam (1989)"},{"key":"1_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Cambridge (2009)","edition":"2"},{"issue":"2","key":"1_CR21","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. Theor. Comput. Sci. 268(2), 221\u2013273 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00272-3","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"1_CR22","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2008.02.021","volume":"397","author":"T Zeugmann","year":"2008","unstructured":"Zeugmann, T., Zilles, S.: Learning recursive functions: a survey. Theor. Comput. Sci. 397(1\u20133), 4\u201356 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.02.021","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2340-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:02:09Z","timestamp":1714690929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2340-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723393","9789819723409"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2340-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tamc2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}