{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:44:29Z","timestamp":1784299469592,"version":"3.55.0"},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":4759,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2001,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Those properties are sometimes called control structures, to emphasize that they yield tools to implement programs in programming systems. It has been studied, among others by Riccardi and Royer, how these control structures influence or even characterize the notion of acceptable programming system. The following is an investigation, how these control structures behave in the more general setting of complete numberings as defined by Mal'cev and Er\u0161ov.<\/jats:p>","DOI":"10.2307\/2694927","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:03:53Z","timestamp":1146938633000},"page":"357-382","source":"Crossref","is-referenced-by-count":15,"title":["Some independence results for control structures in complete numberings"],"prefix":"10.1017","volume":"66","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jochen","family":"Nessel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200011373_ref016","volume-title":"Lecture Notes in Computer Science","author":"Royer","year":"1987"},{"key":"S0022481200011373_ref013","unstructured":"Riccardi G. , The independence of control structures in absract programming systems, Ph.D. dissertation , State University of New York at Buffalo, New York, 1980."},{"key":"S0022481200011373_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00036-C"},{"key":"S0022481200011373_ref003","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-62685-9_24","volume-title":"Proceedings of the Third European Conference on Computation Learning Theory","author":"Case","year":"1997"},{"key":"S0022481200011373_ref002","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"S0022481200011373_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90285-5"},{"key":"S0022481200011373_ref006","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19820282708"},{"key":"S0022481200011373_ref007","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1966-0186541-3"},{"key":"S0022481200011373_ref012","volume-title":"Algorithms and recursive functions","author":"MAl\u010dev","year":"1970"},{"key":"S0022481200011373_ref015","volume-title":"Theory of recursive functions and effective computabittty","author":"Rogers","year":"1987"},{"key":"S0022481200011373_ref010","doi-asserted-by":"publisher","DOI":"10.1080\/09528139408953782"},{"key":"S0022481200011373_ref005","first-page":"208","article-title":"How inductive inference strategies discover their errors","volume":"118","author":"Freivalds","year":"1995","journal-title":"Information and Control"},{"key":"S0022481200011373_ref014","first-page":"304","volume":"21","author":"Rice","year":"1956","journal-title":"On completely recursively enumerable classes and their key arrays"},{"key":"S0022481200011373_ref004","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19730191901"},{"key":"S0022481200011373_ref009","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/168304.168320","volume-title":"Proceedings of the 6th Annual ACM Conference on Computational Learning Theory","author":"Lange","year":"1993"},{"key":"S0022481200011373_ref011","volume-title":"An introduction to the general theory of algorithms","author":"Machtey","year":"1978"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200011373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T10:04:53Z","timestamp":1683453893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200011373\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0022481200011373"],"URL":"https:\/\/doi.org\/10.2307\/2694927","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}