{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:27:56Z","timestamp":1743056876490,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_27","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T09:42:21Z","timestamp":1427881341000},"page":"422-435","source":"Crossref","is-referenced-by-count":3,"title":["The Computational Contents of Ramified Corecurrence"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[]},{"given":"Ramyaa","family":"Ramyaa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Bellantoni, S.: Predicative recursion and computational complexity. PhD thesis, University of Toronto (1992)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions (1992)","DOI":"10.1145\/129712.129740"},{"key":"27_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                      \n                        http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"S.A. Cook","year":"1980","unstructured":"Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput.\u00a09(3), 636\u2013652 (1980)","journal-title":"SIAM J. Comput."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(80)90028-6","volume":"12","author":"G. Cousineau","year":"1980","unstructured":"Cousineau, G.: An algebraic definition for control structures. Theoretical Computer Science\u00a012, 175\u2013192 (1980)","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","series-title":"Dagstuhl Seminar Proceedings","volume-title":"Sublinear Algorithms","year":"2006","unstructured":"Czumaj, A., Muthukrishnan, S.M., Rubinfeld, R., Sohler, C. (eds.): Sublinear Algorithms, July 17-22, 2005. Dagstuhl Seminar Proceedings, vol.\u00a005291. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BF00289513","volume":"1","author":"J. Hartmanis","year":"1972","unstructured":"Hartmanis, J.: On non-determinancy in simple computing devices. Acta Inf.\u00a01, 336\u2013344 (1972)","journal-title":"Acta Inf."},{"key":"27_CR8","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Wolters-Noordhof, Groningen (1952)"},{"key":"27_CR9","series-title":"Perspectives in Computer Science","first-page":"320","volume-title":"Feasible Mathematics II","author":"D. Leivant","year":"1994","unstructured":"Leivant, D.: Ramified recurrence and computational complexity I: Word recurrence and poly-time. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II. Perspectives in Computer Science, pp. 320\u2013343. Birkhauser-Boston, New York (1994)"},{"issue":"1-3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0168-0072(98)00040-2","volume":"96","author":"D. Leivant","year":"1999","unstructured":"Leivant, D.: Ramified recurrence and computational complexity III: higher type recurrence and elementary complexity. Ann. Pure Appl. Logic\u00a096(1-3), 209\u2013229 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1-3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0168-0072(01)00078-1","volume":"114","author":"D. Leivant","year":"2002","unstructured":"Leivant, D.: Intrinsic reasoning about functional programs I: first order theories. Ann. Pure Appl. Logic\u00a0114(1-3), 117\u2013153 (2002)","journal-title":"Ann. Pure Appl. Logic"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Global semantic typing for inductive and coinductive computing. Logical Methods in Computer Science\u00a010(4) (2014)","DOI":"10.2168\/LMCS-10(4:18)2014"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0022277","volume-title":"Computer Science Logic","author":"D. Leivant","year":"1995","unstructured":"Leivant, D., Marion, J.-Y.: Ramified recurrence and computational complexity II: Substitution and poly-space. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 486\u2013500. Springer, Heidelberg (1995)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.entcs.2011.09.025","volume":"276","author":"R. Ramyaa","year":"2011","unstructured":"Ramyaa, R., Leivant, D.: Ramified corecurrence and logspace. Electronic Notes in Theorerical Computer Science\u00a0276, 247\u2013261 (2011)","journal-title":"Electronic Notes in Theorerical Computer Science"},{"key":"27_CR15","first-page":"13","volume":"18","author":"R. Rubinfeld","year":"2011","unstructured":"Rubinfeld, R., Shapira, A.: Sublinear time algorithms. Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 13 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-66473-1","volume-title":"Proof Theory","author":"K. Sch\u00fctte","year":"1977","unstructured":"Sch\u00fctte, K.: Proof Theory. Springer, Berlin (1977)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:20:37Z","timestamp":1559139637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}