{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:04:49Z","timestamp":1750323889164,"version":"3.40.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012632","name":"Nazarbayev University","doi-asserted-by":"publisher","award":["201223FD8823"],"award-info":[{"award-number":["201223FD8823"]}],"id":[{"id":"10.13039\/501100012632","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science and Higher Education of the Republic of Kazakhstan","award":["AP19676989"],"award-info":[{"award-number":["AP19676989"]}]},{"DOI":"10.13039\/501100020822","name":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences","doi-asserted-by":"publisher","award":["FWNF-2022-0011"],"award-info":[{"award-number":["FWNF-2022-0011"]}],"id":[{"id":"10.13039\/501100020822","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00224-024-10201-y","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T04:46:23Z","timestamp":1735274783000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On learning down-sets in quasi-orders, and ideals in Boolean algebras"],"prefix":"10.1007","volume":"69","author":[{"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]},{"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"10201_CR1","unstructured":"Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy, vol. 144 of Stud. Logic Found. Math.. Elsevier Science B.V., Amsterdam (2000)"},{"key":"10201_CR2","unstructured":"Alaev, P.E.: Thin computable Boolean algebras. In: Mathematics in the modern world: the Russian conference dedicated to the fiftieth anniversary of the Sobolev institute of mathematics, pp.\u00a019. Novosibirsk (2007). In Russian, available at http:\/\/old.math.nsc.ru\/conference\/conf50\/Abstracts.pdf"},{"issue":"2","key":"10201_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)","journal-title":"Inf. Control"},{"key":"10201_CR4","doi-asserted-by":"publisher","first-page":"104590","DOI":"10.1016\/j.ic.2020.104590","volume":"275","author":"N Bazhenov","year":"2020","unstructured":"Bazhenov, N., Fokina, E., San Mauro, L.: Learning families of algebraic structures from informant. Inf. Comput. 275, 104590 (2020)","journal-title":"Inf. Comput."},{"key":"10201_CR5","doi-asserted-by":"crossref","unstructured":"Bazhenov, N., Fokina, E., Rossegger, D., Soskova, A., Vatev, S.: Learning families of algebraic structures from text. In: L. Levy Patey, E. Pimentel, L. Galeotti, F. Manea, eds., Twenty years of theoretical and practical synergies - 20th conference on computability in Europe, CiE 2024, vol. 14773 of Lect. Notes Comput. Sci., pp. 166\u2013178. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-64309-5_14"},{"key":"10201_CR6","doi-asserted-by":"crossref","unstructured":"Bazhenov, N., Mustafa, M.: On learning families of ideals in lattices and Boolean algebras. In: X. Chen, B. Li, eds, Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, vol. 14637 of Lect. Notes Comput. Sci., pp 1\u201313. Springer, Singapore (2024)","DOI":"10.1007\/978-981-97-2340-9_1"},{"key":"10201_CR7","unstructured":"Cooper, S.B.: Degrees of unsolvability. PhD thesis, Leicester University (1971)"},{"key":"10201_CR8","first-page":"1","volume-title":"Well-quasi orders in computation, logic, language and reasoning","author":"R Carroy","year":"2020","unstructured":"Carroy, R., Pequignot, Y.: Well, better and in-between. In: Schuster, P.M., Seisenberger, M., Weiermann, A. (eds.) Well-quasi orders in computation, logic, language and reasoning, pp. 1\u201327. Springer, Cham (2020)"},{"key":"10201_CR9","doi-asserted-by":"crossref","unstructured":"de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of closed set systems from positive data. In: T. Washio, K. Satoh, H. Takeda, A. Inokuchi, eds, New frontiers in artificial intelligence, JSAI 2006, vol. 4384 of Lect. Notes Comput. Sci., pp. 265\u2013275. Berlin, Springer (2006)","DOI":"10.1007\/978-3-540-69902-6_23"},{"issue":"4","key":"10201_CR10","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)","journal-title":"Inf. Comput."},{"key":"10201_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2015.11.042","volume":"612","author":"A Gavryushkin","year":"2016","unstructured":"Gavryushkin, A., Khoussainov, B., Stephan, F.: Reducibilities among equivalence relations induced by recursively enumerable structures. Theor. Comput. Sci. 612, 137\u2013152 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10201_CR12","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)","journal-title":"Inf. Control"},{"key":"10201_CR13","volume-title":"Countable Boolean algebras and decidability","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S.: Countable Boolean algebras and decidability. Consultants Bureau, New York (1997)"},{"key":"10201_CR14","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)"},{"key":"10201_CR15","doi-asserted-by":"crossref","unstructured":"Gao, Z., Stephan, F., Wu, G., Yamamoto, A.: Learning families of closed sets in matroids. In: M.J. Dinneen, B. Khoussainov, A. Nies, eds, Computation, Physics and Beyond - International Workshop on Theoretical Computer Science, WTCS 2012, vol. 7160 of Lect. Notes Comput. Sci., pp. 120\u2013139. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-27654-5_10"},{"issue":"1\u20133","key":"10201_CR16","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)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10201_CR17","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"10201_CR18","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":"10201_CR19","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":"10201_CR20","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)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10201_CR21","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1023\/A:1026569206678","volume":"29","author":"E Martin","year":"2000","unstructured":"Martin, E., Osherson, D.N.: Scientific discovery on positive data via belief revision. J. Philos. Log. 29(5), 483\u2013506 (2000)","journal-title":"J. Philos. Log."},{"key":"10201_CR22","doi-asserted-by":"crossref","unstructured":"Montalb\u00e1n, A.: Computable structure theory: within the arithmetic. Cambridge University Press (2021)","DOI":"10.1017\/9781108525749"},{"key":"10201_CR23","unstructured":"Odifreddi, P.: Classical recursion theory, vol. 125 of Stud. Logic Found. Math. Elsevier Science B.V., Amsterdam (1992)"},{"issue":"1","key":"10201_CR24","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)","journal-title":"J. Symb. Log."},{"key":"10201_CR25","unstructured":"Remmel, J.B.: Recursive Boolean algebras. In: J.\u00a0Donald Monk, R. Bonnet, eds, Handbook of Boolean algebras, vol. 3, pp. 1097\u20131165. North-Holland, Amsterdam (1989)"},{"issue":"2","key":"10201_CR26","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)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"10201_CR27","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)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10201-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10201-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10201-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T17:10:11Z","timestamp":1744132211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10201-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10201"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10201-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1"}}