{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T07:50:56Z","timestamp":1672300256033},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":3058,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log."],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>I survey the syntactic technique of tiering which can be used to restrict the power of a recursion scheme. I show how various results can be obtained entirely proof theoretically without the use of a model of computation.<\/jats:p>","DOI":"10.2178\/bsl\/1122038991","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T18:50:25Z","timestamp":1122058225000},"page":"321-350","source":"Crossref","is-referenced-by-count":6,"title":["Tiering as a Recursion Technique"],"prefix":"10.1017","volume":"11","author":[{"given":"Harold","family":"Simmons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600003103_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/s001530050160"},{"key":"S1079898600003103_ref013","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BFb0037112","volume-title":"Typedlambda calculi and applications","volume":"664","author":"Leivant","year":"1993"},{"key":"S1079898600003103_ref015","unstructured":"Murawski A. S. and Ong C.-H. L. , Can safe recursion be interpreted in light linear logic?, paper presented at ICC '00, 2000."},{"key":"S1079898600003103_ref007","first-page":"275","volume-title":"CSL 97","volume":"1414","author":"Hofmann"},{"key":"S1079898600003103_ref014","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/FI-1993-191-207","article-title":"Lambda calculus characterization of poly-time","volume":"19","author":"Leivant","year":"1993","journal-title":"Fundamenta Informatica"},{"key":"S1079898600003103_ref009","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(00)00010-5"},{"key":"S1079898600003103_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2566-9"},{"key":"S1079898600003103_ref018","unstructured":"Simmons H. , Fiering for natural number systems, http:\/\/www.cs.man.ac.uk\/~hsimmons\/DOCUMENTS\/papersandnotes.html."},{"key":"S1079898600003103_ref003","doi-asserted-by":"crossref","unstructured":"Bellantoni S. , Predicative recursion and the polytime hierarchy, In Clote and Remmel [6], pp. 15\u201329.","DOI":"10.1007\/978-1-4612-2566-9_2"},{"key":"S1079898600003103_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201998"},{"key":"S1079898600003103_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90053-5"},{"key":"S1079898600003103_ref005","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1190150032"},{"key":"S1079898600003103_ref008","volume-title":"Proceedings of the Symposium of the 14th LICS","author":"Hofmann","year":"1999"},{"key":"S1079898600003103_ref016","doi-asserted-by":"publisher","DOI":"10.1007\/BF02276799"},{"key":"S1079898600003103_ref002","unstructured":"Bellantoni S. , Predicative recursion and computational complexity, Ph.D. thesis, University of Toronto, 1992."},{"key":"S1079898600003103_ref011","doi-asserted-by":"crossref","unstructured":"Leivant D. , Ramified recurrence and computational complexity I: Word recurrence and poly-time, In Clote and Remmel [6], pp. 320\u2013343.","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"S1079898600003103_ref017","doi-asserted-by":"publisher","DOI":"10.1007\/BF01620765"},{"key":"S1079898600003103_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00040-2"}],"container-title":["Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600003103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:32:30Z","timestamp":1626215550000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600003103\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S1079898600003103"],"URL":"https:\/\/doi.org\/10.2178\/bsl\/1122038991","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}