{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:25Z","timestamp":1725686665703},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_43","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"422-431","source":"Crossref","is-referenced-by-count":1,"title":["Degrees of Total Algorithms versus Degrees of Honest Functions"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"LNL","first-page":"205","volume-title":"G\u00f6del 1996","author":"B. Blankertz","year":"1996","unstructured":"Blankertz, B., Weiermann, A.: How to Characterize Provably Total Functions. In: Hajek (ed.) G\u00f6del 1996. LNL, vol.\u00a06, pp. 205\u2013213. Springer, Heidelberg (1996)"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/malq.19940400212","volume":"40","author":"W. Buchholz","year":"1994","unstructured":"Buchholz, W., Cichon, A., Weiermann, A.: A Uniform Approach to Fundamental Sequences and Hierarchies. Mathematical Logic Quarterly\u00a040, 273\u2013286 (1994)","journal-title":"Mathematical Logic Quarterly"},{"key":"43_CR3","unstructured":"Cai, M.: Degrees of Relative Provability. Accepted for publication in the Notre Dame Journal of Formal Logic (manuscript)"},{"key":"43_CR4","unstructured":"Cai, M.: Elements of Classical Recursion Theory: Degree-Theoretic Properties and Combinatorial Properties. PhD Thesis, Department of Mathematics, Cornell University (2011)"},{"key":"43_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198532132.001.0001","volume-title":"Models of Peano Arithmetic","author":"R. Kaye","year":"1991","unstructured":"Kaye, R.: Models of Peano Arithmetic. Clarendon Press, Oxford (1991)"},{"key":"43_CR6","series-title":"LNL","first-page":"235","volume-title":"G\u00f6del 1996","author":"L. Kristiansen","year":"1996","unstructured":"Kristiansen, L.: Information Content and Computational Complexity of Recursive Sets. In: Hajek (ed.) G\u00f6del 1996. LNL, vol.\u00a06, pp. 235\u2013246. Springer, Heidelberg (1996)"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s001530050086","volume":"37","author":"L. Kristiansen","year":"1998","unstructured":"Kristiansen, L.: A Jump Operator on Honest Subrecursive Degrees. Archive for Mathematical Logic\u00a037, 105\u2013125 (1998)","journal-title":"Archive for Mathematical Logic"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/PL00003845","volume":"40","author":"L. Kristiansen","year":"2001","unstructured":"Kristiansen, L.: Subrecursive Degrees and Fragments of Peano Arithmetic. Archive for Mathematical Logic\u00a040, 365\u2013397 (2001)","journal-title":"Archive for Mathematical Logic"},{"key":"43_CR9","unstructured":"Kristiansen, L.: Papers on Subrecursion Theory. Dr Scient Thesis, Department of Informatics, University of Oslo (1996) ISBN 82-7368-130-0"},{"key":"43_CR10","first-page":"286","volume-title":"Combinatorics, Computation and Logic","author":"L. Kristiansen","year":"1999","unstructured":"Kristiansen, L.: $\\mbox{Low}_n$ , $\\mbox{High}_n$ , and Intermediate Subrecursive Degrees. In: Calude, Dinneen (eds.) Combinatorics, Computation and Logic, pp. 286\u2013300. Springer, Singapore (1999)"},{"key":"43_CR11","unstructured":"Kristiansen, L., Lubarsky, R.S., Weiermann, A., Schlage-Puchta, J.-C.: On the Structure of Honest Elementary Degrees. In: Friedman, Koerwien, M\u00fcller (eds.) Accepted for Publication in the Proceedings of the Infinity Project"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.apal.2011.11.004","volume":"163","author":"L. Kristiansen","year":"2012","unstructured":"Kristiansen, L., Weiermann, A., Schlage-Puchta, J.-C.: Streamlined Subrecursive Degree Theory. Annals of Pure and Applied Logic\u00a0163, 698\u2013716 (2012)","journal-title":"Annals of Pure and Applied Logic"},{"key":"43_CR13","series-title":"LNL","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21635-4","volume-title":"Aspects of Incompleteness","author":"P. Lindstr\u00f6m","year":"1997","unstructured":"Lindstr\u00f6m, P.: Aspects of Incompleteness. LNL, vol.\u00a010. Springer, Berlin (1997)"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/S0022-0000(72)80032-1","volume":"6","author":"M. Machtey","year":"1972","unstructured":"Machtey, M.: Augmented Loop Languages and Classes of Computable Functions. Journal of Computer and System Sciences\u00a06, 603\u2013624 (1972)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0019-9958(74)80039-2","volume":"24","author":"M. Machtey","year":"1974","unstructured":"Machtey, M.: The Honest Subrecursive Classes are a Lattice. Information and Control\u00a024, 247\u2013263 (1974)","journal-title":"Information and Control"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0022-0000(75)80039-0","volume":"10","author":"M. Machtey","year":"1975","unstructured":"Machtey, M.: On the Density of Honest Subrecursive Classes. Journal of Computer and System Sciences\u00a010, 183\u2013199 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/malq.19720180405","volume":"18","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Ritchie, D.M.: A Classification of the Recursive Functions. Zeitschr. f. Math. Logik und Grundlagen d. Math. Bd.\u00a018, 71\u201382 (1972)","journal-title":"Math. Logik und Grundlagen d. Math. Bd."},{"key":"43_CR18","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland (1989)"},{"key":"43_CR19","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill (1967)"},{"key":"43_CR20","volume-title":"Subrecursion. Functions and Hierarchies","author":"H.E. Rose","year":"1984","unstructured":"Rose, H.E.: Subrecursion. Functions and Hierarchies. Clarendon Press, Oxford (1984)"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T20:46:29Z","timestamp":1713991589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}