{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:04:03Z","timestamp":1759147443449},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,2,14]],"date-time":"2015-02-14T00:00:00Z","timestamp":1423872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00153-015-0422-2","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T09:34:29Z","timestamp":1424165669000},"page":"471-485","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Predicatively computable functions on sets"],"prefix":"10.1007","volume":"54","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"422_CR1","doi-asserted-by":"crossref","unstructured":"Arai T., Moser G.: Proofs of Termination of Rewrite Systems for Polytime Functions. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005: Foundations of software technology and theoretical computer science, pp.529\u2013540. Lecture Notes in Compt. Sci. vol. 3821, Springer, Berlin (2005)","DOI":"10.1007\/11590156_43"},{"key":"422_CR2","unstructured":"Beckmann, A., Buss, S.R., Friedman, S.-D.: Safe recursive set functions (submitted)"},{"key":"422_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni S., Cook S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complex. 2, 97\u2013110 (1992)","journal-title":"Comput. Complex."},{"key":"422_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0003-4843(72)90001-0","volume":"4","author":"R. Jensen","year":"1972","unstructured":"Jensen R.: The fine structure of the constructible hierarchy. Ann. Math. Logic 4, 229\u2013308 (1972)","journal-title":"Ann. Math. Logic"},{"key":"422_CR5","doi-asserted-by":"crossref","unstructured":"Jensen, R., Karp, C.: Primitive recursive set functions. In: Scott, D. (ed.) Axiomatic Set Theory, pp. 143\u2013176. Proceedings of Symposia in Pure Mathematics, vol. 13, Part I, American Mathematical Society, Providence, RI (1971)","DOI":"10.1090\/pspum\/013.1\/0281602"},{"key":"422_CR6","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Martini, S., Zorzi, M.: General ramified recurrence is sound for polynomial time. In: Baillot, P. (ed.) Workshop on Developments in Implicit Complexity (DICE2010), pp. 47\u201362. EPTCS 23 (2010)","DOI":"10.4204\/EPTCS.23.4"},{"key":"422_CR7","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 325\u2013333. ACM (1993)","DOI":"10.1145\/158511.158659"},{"key":"422_CR8","doi-asserted-by":"crossref","unstructured":"Plump, D.: Term graph rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, ch. 1, pp. 3\u201361. World Scientific, Singapore s(1999)","DOI":"10.1142\/9789812815149_0001"},{"key":"422_CR9","doi-asserted-by":"crossref","first-page":"954","DOI":"10.2307\/2275441","volume":"57","author":"M. Rathjen","year":"1992","unstructured":"Rathjen M.: A proof-theoretic characterization of the primitive recursive set functions. J. Symb. Logic 57, 954\u2013969 (1992)","journal-title":"J. Symb. Logic"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0422-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-015-0422-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0422-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:12:54Z","timestamp":1566346374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-015-0422-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,14]]},"references-count":9,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["422"],"URL":"https:\/\/doi.org\/10.1007\/s00153-015-0422-2","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,14]]}}}