{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:48:58Z","timestamp":1742924938847,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_5","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"38-49","source":"Crossref","is-referenced-by-count":3,"title":["Independence Results for n-Ary Recursion Theorems"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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); Reprinted. MIT Press (1987)"},{"key":"5_CR2","unstructured":"Riccardi, G.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)"},{"key":"5_CR3","unstructured":"INRIA: Objective Caml, \n                    \n                      http:\/\/caml.inria.fr\/ocaml\/index.en.html"},{"key":"5_CR4","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., Young, P.: An Introduction to the General Theory of Algorithms. North-Holland, Amsterdam (1978)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-18253-5","volume-title":"A Connotational Theory of Program Structure","author":"J.S. Royer","year":"1987","unstructured":"Royer, J.S.: A Connotational Theory of Program Structure. LNCS, vol.\u00a0273. Springer, Heidelberg (1987)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Manna, Z., Ness, S., Vuillemin, J.: Inductive methods for proving properties of programs. In: Proc. of ACM Conference on Proving Assertions about Programs, pp. 27\u201350 (1972)","DOI":"10.1145\/942580.807070"},{"key":"5_CR7","volume-title":"Theory of Formal Systems. Annals of Mathematics Studies","author":"R. Smullyan","year":"1961","unstructured":"Smullyan, R.: Theory of Formal Systems. Annals of Mathematics Studies, vol.\u00a047. Princeton University Press, Princeton (1961)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/malq.19760220102","volume":"22","author":"J. Case","year":"1976","unstructured":"Case, J.: Sortability and extensibility of the graphs of r.e. partial and total orders. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a022(1), 1\u201318 (1976)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"5_CR9","series-title":"Fundamental Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, 2nd edn. Fundamental Algorithms, vol.\u00a0I. Addison-Wesley, Reading (1973)","edition":"2"},{"key":"5_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60217-8_1","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"R. Wiehagen","year":"1995","unstructured":"Wiehagen, R., Zeugmann, T.: Learning and consistency. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol.\u00a0961, pp. 1\u201324. Springer, Heidelberg (1995)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","volume":"22","author":"G. Riccardi","year":"1981","unstructured":"Riccardi, G.: The independence of control structures in abstract programming systems. Journal of Computer and System Sciences\u00a022(2), 107\u2013143 (1981)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R.M. Friedberg","year":"1958","unstructured":"Friedberg, R.M.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. Journal of Symbolic Logic\u00a023(3), 309\u2013316 (1958)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(90)90141-4","volume":"74","author":"M. Kummer","year":"1990","unstructured":"Kummer, M.: An easy priority-free proof of a theorem of Friedberg. Theoretical Computer Science\u00a074(2), 249\u2013251 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"5802","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1126\/science.1135929","volume":"314","author":"C. Adami","year":"2006","unstructured":"Adami, C.: What do robots dream of? Science\u00a0314(5802), 1093\u20131094 (2006)","journal-title":"Science"},{"issue":"5802","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1126\/science.1133687","volume":"314","author":"J. Bongard","year":"2006","unstructured":"Bongard, J., Zykov, V., Lipson, H.: Resilient machines through continuous self-modeling. Science\u00a0314(5802), 1118\u20131121 (2006)","journal-title":"Science"},{"issue":"5816","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1126\/science.315.5816.1219b","volume":"315","author":"R. Conduit","year":"2007","unstructured":"Conduit, R.: To sleep, perchance to dream. Science\u00a0315(5816), 1219\u20131220 (2007); A letter, including responses from Adami, C., Lipson, H., et al.","journal-title":"Science"},{"issue":"5825","key":"5_CR17","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1126\/science.316.5825.688c","volume":"316","author":"J. Schmidhuber","year":"2007","unstructured":"Schmidhuber, J.: Prototype resilient, self-modeling robots. Science\u00a0316(5825), 688 (2007); A letter, including responses from Lipson, H., et al.","journal-title":"Science"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-73001-9_13","volume-title":"Computation and Logic in the Real World","author":"J. Case","year":"2007","unstructured":"Case, J., Moelius, S.: Characterizing Programming Systems Allowing Program Self-reference. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 125\u2013134. Springer, Heidelberg (2007)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Case, J., Moelius, S.: Independence Results for n-Ary Recursion Theorems (Expanded Version) (2009), \n                    \n                      http:\/\/www.cis.udel.edu\/~moelius\/publications","DOI":"10.1007\/978-3-642-03409-1_5"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(80)90017-1","volume":"11","author":"D. Kozen","year":"1980","unstructured":"Kozen, D.: Indexings of subrecursive classes. Theoretical Computer Science\u00a011(3), 277\u2013301 (1980)","journal-title":"Theoretical Computer Science"},{"key":"5_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0249-3","volume-title":"Subrecursive Programming Systems: Complexity and Succinctness","author":"J. Royer","year":"1994","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Birkh\u00e4user, Boston (1994)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Bertot, Y., Komendantsky, V.: Fixed point semantics and partial recursion in Coq. In: PPDP 2008: Proc. of 10th Intl. ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 89\u201396 (2008)","DOI":"10.1145\/1389449.1389461"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-74456-6_24","volume-title":"Mathematical Foundations of Computer Science 2007","author":"J. Case","year":"2007","unstructured":"Case, J., Moelius, S.: Properties Complementary to Program Self-Reference. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 253\u2013263. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:15:02Z","timestamp":1580296502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}