{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T14:32:59Z","timestamp":1723645979301},"reference-count":34,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T00:00:00Z","timestamp":1309392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"},{"start":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T00:00:00Z","timestamp":1309392000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Quarterly"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1002\/malq.201020054","type":"journal-article","created":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T15:53:04Z","timestamp":1309449184000},"page":"504-516","source":"Crossref","is-referenced-by-count":3,"title":["Rice and Rice-Shapiro Theorems for transfinite correction grammars"],"prefix":"10.1002","volume":"57","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2011,6,30]]},"reference":[{"key":"10.1002\/malq.201020054-BIB1|cit1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2178\/jsl\/1080938842","article-title":"Parsimony hierarchies for inductive inference","volume":"69","author":"Ambainis","year":"2004","journal-title":"J. Symb. Log."},{"key":"10.1002\/malq.201020054-BIB2|cit2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1999-40101","article-title":"Inductive inference with procrastination: Back to definitions","volume":"40","author":"Ambainis","year":"1999","journal-title":"Fundam. Inform."},{"key":"10.1002\/malq.201020054-BIB3|cit3","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/malq.19960420138","article-title":"Recursive structures and Ershov's hierarchy","volume":"42","author":"Ash","year":"1996","journal-title":"Math. Log. Q."},{"key":"10.1002\/malq.201020054-BIB4|cit4","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1002\/malq.201020054-BIB5|cit5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0168-0072(94)00056-9","article-title":"Proof-theoretic analysis of termination proofs","volume":"75","author":"Buchholz","year":"1995","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1002\/malq.201020054-BIB6|cit6","first-page":"143","volume-title":"Proceedings of the 2005 Business and Industry Symposium and the 2005 Military, Government, and Aerospace Simulation Symposium","author":"Burgin","year":"2005"},{"issue":"2","key":"10.1002\/malq.201020054-BIB7|cit7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.2178\/jsl\/1243948324","article-title":"Learning correction grammars","volume":"74","author":"Carlucci","year":"2009","journal-title":"J. Symb. Log."},{"key":"10.1002\/malq.201020054-BIB8|cit8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-87987-9_32","volume-title":"19th International Conference on Algorithmic Learning Theory (ALT\u201908)","author":"Case","year":"2008"},{"key":"10.1002\/malq.201020054-BIB9|cit9","unstructured":"J. Case J. Royer Program size complexity of correction grammars 2010"},{"key":"10.1002\/malq.201020054-BIB10|cit10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0090937","volume-title":"Logic Year 1979-80","author":"Epstein","year":"1981"},{"key":"10.1002\/malq.201020054-BIB11|cit11","first-page":"23","article-title":"A hierarchy of sets I","volume":"7","author":"Ershov","year":"1968","journal-title":"Alg. Log."},{"key":"10.1002\/malq.201020054-BIB12|cit12","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF02218664","article-title":"A hierarchy of sets II","volume":"7","author":"Ershov","year":"1968","journal-title":"Alg. Log."},{"key":"10.1002\/malq.201020054-BIB13|cit13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF02219847","article-title":"A hierarchy of sets III","volume":"9","author":"Ershov","year":"1970","journal-title":"Alg. Log."},{"issue":"2","key":"10.1002\/malq.201020054-BIB14|cit14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/inco.1993.1068","article-title":"On the role of procrastination in machine learning","volume":"107","author":"Freivalds","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1002\/malq.201020054-BIB15|cit15","doi-asserted-by":"crossref","first-page":"352","DOI":"10.4153\/CJM-1975-043-4","article-title":"Rice theorems for d.r.e. sets","volume":"27","author":"Hay","year":"1975","journal-title":"Can. J. Math."},{"key":"10.1002\/malq.201020054-BIB16|cit16","volume-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1002\/malq.201020054-BIB17|cit17","doi-asserted-by":"crossref","first-page":"794","DOI":"10.4153\/CJM-1977-082-3","article-title":"Rice theorems for \u03a3\u22121n sets","volume":"29","author":"Johnson","year":"1977","journal-title":"Can. J. Math."},{"key":"10.1002\/malq.201020054-BIB18|cit18","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","article-title":"Notations for ordinal numbers","volume":"3","author":"Kleene","year":"1938","journal-title":"J. Symb. Log."},{"key":"10.1002\/malq.201020054-BIB19|cit19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2307\/2371894","article-title":"On the forms of predicates in the theory of constructive ordinals","volume":"66","author":"Kleene","year":"1944","journal-title":"Am. J. Math."},{"key":"10.1002\/malq.201020054-BIB20|cit20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.2307\/2372632","article-title":"On the forms of predicates in the theory of constructive ordinals (second paper)","volume":"77","author":"Kleene","year":"1955","journal-title":"Am. J. Math."},{"key":"10.1002\/malq.201020054-BIB21|cit21","volume-title":"Set Theory, Studies in Logic and the Foundations of Mathematics Vol. 86","author":"Kuratowski","year":"1967"},{"key":"10.1002\/malq.201020054-BIB22|cit22","volume-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1002\/malq.201020054-BIB23|cit23","first-page":"205","article-title":"A fixed point theorem in recursion theory","volume":"20","author":"Myhill","year":"1955","journal-title":"J. Symb. Log."},{"key":"10.1002\/malq.201020054-BIB24|cit24","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/CBO9781107325944.011","volume-title":"Sets and Proofs","author":"Rathjen","year":"1999"},{"key":"10.1002\/malq.201020054-BIB25|cit25","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1090\/S0002-9947-1953-0053041-6","article-title":"Class of recursively enumerable sets and their decision problems","volume":"74","author":"Rice","year":"1953","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1002\/malq.201020054-BIB26|cit26","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1002\/malq.201020054-BIB27|cit27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0249-3","volume-title":"Subrecursive Programming Systems: Complexity and Succinctness, Progress in Theoretical Computer Science","author":"Royer","year":"1994"},{"key":"10.1002\/malq.201020054-BIB28|cit28","doi-asserted-by":"crossref","unstructured":"G. Sacks Higher Recursion Theory, Perspectives in Mathematical Logic Springer-Verlag Berlin 1990","DOI":"10.1007\/978-3-662-12013-2"},{"issue":"5","key":"10.1002\/malq.201020054-BIB29|cit29","first-page":"146","article-title":"On a hierarchy of limiting computations","volume":"25","author":"Selivanov","year":"1984","journal-title":"Sib. Mat. Zh."},{"issue":"2","key":"10.1002\/malq.201020054-BIB30|cit30","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ic.2003.11.001","article-title":"Generalized notions of mind change complexity","volume":"189","author":"Sharma","year":"2004","journal-title":"Inform. Comput."},{"key":"10.1002\/malq.201020054-BIB31|cit31","volume-title":"Cardinal and ordinal numbers, Second revised ed","author":"Sierpi\u0144ski","year":"1965"},{"key":"10.1002\/malq.201020054-BIB32|cit32","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.apal.2009.01.008","article-title":"Turing oracle machines, online computing, and three displacements in computability theory","volume":"160","author":"Soare","year":"2009","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1002\/malq.201020054-BIB33|cit33","volume-title":"Proof Theory, second ed., Studies in Logic and the Foundations of Mathematics Vol. 81","author":"Takeuti","year":"1987"},{"key":"10.1002\/malq.201020054-BIB34|cit34","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BFb0023786","volume-title":"Computer Science Logic, 5th Workshop","author":"Weiermann","year":"1992"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.201020054","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.201020054","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/onlinelibrary.wiley.com\/wol1\/doi\/10.1002\/malq.201020054\/fullpdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T14:10:12Z","timestamp":1625321412000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.201020054"}},"subtitle":["Rice and Rice-Shapiro Theorems"],"short-title":[],"issued":{"date-parts":[[2011,6,30]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"URL":"https:\/\/doi.org\/10.1002\/malq.201020054","archive":["Portico"],"relation":{},"ISSN":["0942-5616"],"issn-type":[{"value":"0942-5616","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6,30]]}}}