{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:03:13Z","timestamp":1648684993942},"reference-count":15,"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":1472,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of primitive recursive degrees.<\/jats:p>","DOI":"10.2178\/jsl\/1264433922","type":"journal-article","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T15:38:59Z","timestamp":1264433939000},"page":"289-313","source":"Crossref","is-referenced-by-count":1,"title":["The Ackermann functions are not optimal, but by how much?"],"prefix":"10.1017","volume":"75","author":[{"given":"H.","family":"Simmons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002966_ref015","volume-title":"Annals of Mathematics Studies, no. 47","author":"Smullyan","year":"1961"},{"key":"S0022481200002966_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75462-3"},{"key":"S0022481200002966_ref013","volume-title":"Derivation and computation","author":"Simmons","year":"2000"},{"key":"S0022481200002966_ref011","volume-title":"Subrecursion, functions and hierarchies","author":"Rose","year":"1984"},{"key":"S0022481200002966_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1948-09121-2"},{"key":"S0022481200002966_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/BF01472200"},{"key":"S0022481200002966_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/BF01973616"},{"key":"S0022481200002966_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01967649"},{"key":"S0022481200002966_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459088"},{"key":"S0022481200002966_ref003","first-page":"1","article-title":"Some classes of recursive functions","volume":"4","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Matematyczne"},{"key":"S0022481200002966_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71513-1"},{"key":"S0022481200002966_ref012","volume-title":"A density property of the primitive recursive degrees","author":"Simmons"},{"key":"S0022481200002966_ref009","volume-title":"Recursive functions","author":"P\u00e9ter","year":"1967"},{"key":"S0022481200002966_ref007","volume-title":"Classical recursion theory","volume":"II","author":"Odifreddi","year":"1999"},{"key":"S0022481200002966_ref006","volume-title":"Combinatorial number theory","author":"McBeth","year":"1994"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:37:23Z","timestamp":1556483843000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002966\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S0022481200002966"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1264433922","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}