{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:55Z","timestamp":1725512095798},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_13","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"148-159","source":"Crossref","is-referenced-by-count":2,"title":["The Structure of Detour Degrees"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul J.","family":"Voda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Handbook of Computability Theory","author":"K. Ambos-Spies","year":"1999","unstructured":"Ambos-Spies, K.: Polynomial time reducibilities and degrees. In: Griffor, E. (ed.) Handbook of Computability Theory, Elsevier, Amsterdam (1999)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/S0022-0000(70)80042-3","volume":"4","author":"S. Basu","year":"1970","unstructured":"Basu, S.: On the structure of subrecursive degrees. J. Comput. System Sci.\u00a04, 452\u2013464 (1970)","journal-title":"J. Comput. System Sci."},{"key":"13_CR3","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1999","unstructured":"Clote, P.: Computation models and function algebra. In: Griffor, E. (ed.) Handbook of Computability Theory, Elsevier, Amsterdam (1999)"},{"key":"13_CR4","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne IV, Warszawa (1953)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of Logspace and Linspace. Computational Complexity\u00a014, 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"13_CR6","volume-title":"Theory of Computing Systems","author":"L. Kristiansen","year":"2007","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies induced by fragments of G\u00f6del\u2019s T. In: Theory of Computing Systems, Springer, Heidelberg (July 2007)"},{"key":"13_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":"13_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":"13_CR9","series-title":"Lecture Notes in Logic.","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-662-21963-8_17","volume-title":"G\u00f6del 1996. Logical Foundations of Mathematics, Computer Science and Physics \u2013 Kurt G\u00f6del Legacy","author":"L. Kristiansen","year":"1996","unstructured":"Kristiansen, L.: Information content and computational complexity of recursive sets. In: G\u00f6del 1996. Logical Foundations of Mathematics, Computer Science and Physics \u2013 Kurt G\u00f6del Legacy. Lecture Notes in Logic., vol.\u00a06, pp. 235\u2013246. Springer, Heidelberg (1996)"},{"key":"13_CR10","series-title":"Australian Computer Science Communications","first-page":"235","volume-title":"Combinatorics, computation and logic","author":"L. Kristiansen","year":"1996","unstructured":"Kristiansen, L.: Low\n                  \n                    n\n                  , high\n                  \n                    n\n                  , and intermediate subrecursive degrees. In: Combinatorics, computation and logic. Proceedings of DMTCS 1999 and CATS 1999, Auckland, New Zealand. Australian Computer Science Communications, vol.\u00a021, pp. 235\u2013246. Springer, Heidelberg (1996)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Barra, G.: The small Grzegorczyk classes and the typed \u03bb-calculus. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 252\u2013262. Springer, Heidelberg (2005)"},{"key":"13_CR12","unstructured":"Kristiansen, L., Voda, P.: Constant detours do not matter and so \n                    \n                      \n                    \n                    ${\\mathcal P}_*={\\mathcal E}^0_*$\n                  , \n                    \n                      http:\/\/www.ii.fmph.uniba.sk\/~voda\/E0.ps"},{"key":"13_CR13","first-page":"1","volume":"12","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nordic Journal of Computing\u00a012, 1\u201327 (2005) (special issue for NWPT 2004)","journal-title":"Nordic Journal of Computing"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11750321_62","volume-title":"Theory and Applications of Models of Computation","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L., Voda, P.: The trade-off theorem and fragments of G\u00f6del\u2019s T. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 654\u2013674. Springer, Heidelberg (2006)"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"Ladner, R.: On the structure of polynomial time reducibility. J. Assoc. Comput. Mach.\u00a022, 155\u2013171 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR16","doi-asserted-by":"crossref","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. J. Comput. System Sci.\u00a010, 183\u2013199 (1975)","journal-title":"J. Comput. System Sci."},{"key":"13_CR17","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":"13_CR18","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. J. Comput. System Sci.\u00a06, 603\u2013624 (1972)","journal-title":"J. Comput. System Sci."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/S0097539701385958","volume":"31","author":"W. Merkle","year":"2002","unstructured":"Merkle, W.: Lattice embeddings for abstract bounded reducibilities. SIAM Journal on Computing\u00a031, 1119\u20131155 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/malq.19720180405","volume":"18","author":"A. Meyer","year":"1972","unstructured":"Meyer, A., Ritchie, D.: A classification of the recursive functions. Z. Math. Logik Grundlagen Math.\u00a018, 71\u201382 (1972)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"13_CR21","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical recursion theory. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a0125, (Paperback edition 1992 edn.) North-Holland Publishing Co., Amsterdam (1989)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/1993719","volume":"106","author":"R.W. Ritchie","year":"1963","unstructured":"Ritchie, R.W.: Classes of predictably computable functions. Transactions of the American Mathematical Society\u00a0106, 139\u2013173 (1963)","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:10Z","timestamp":1619507650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_13","relation":{},"subject":[]}}