{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:23:08Z","timestamp":1648779788729},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T00:00:00Z","timestamp":1322092800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00224-011-9377-9","type":"journal-article","created":{"date-parts":[[2011,11,26]],"date-time":"2011-11-26T01:33:18Z","timestamp":1322271198000},"page":"85-105","source":"Crossref","is-referenced-by-count":1,"title":["Non-determinism in G\u00f6del\u2019s System T"],"prefix":"10.1007","volume":"51","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[]},{"given":"Bedeho Mesghina Wolde","family":"Mender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,24]]},"reference":[{"key":"9377_CR1","volume-title":"Handbook of Proof Theory","author":"J. Avigad","year":"1998","unstructured":"Avigad, J., Feferman, S.: G\u00f6del\u2019s functional interpretation. In: Buss, S. (ed.) Handbook of Proof Theory. Elsevier, Amsterdam (1998)"},{"key":"9377_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-36498-6","volume-title":"Continuous Semantics for Strong Normalization","author":"U. Berger","year":"2003","unstructured":"Berger, U.: Continuous Semantics for Strong Normalization. Lecture Notes in Computer Science, vol.\u00a03526, pp. 23\u201334. Springer, Berlin (2003)"},{"key":"9377_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-45220-1_28","volume-title":"CSL 2003: Computer Science Logic","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.: The surprising power of restricted programs and G\u00f6del\u2019s functionals. In: Baaz, M., Makowsky, J. (eds.) CSL 2003: Computer Science Logic. Lecture Notes in Computer Science, vol. 2803, pp.\u00a0345\u2013358. Springer, Berlin (2003)"},{"key":"9377_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"CiE 2005: 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., et al. (eds.) CiE 2005: New Computational Paradigms. Lecture Notes in Computer Science, vol. 3526, pp.\u00a0252\u2013262. Springer, Berlin (2005)"},{"key":"9377_CR5","first-page":"1","volume":"12","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nord. J. Comput. 12, 1\u201327 (2005)","journal-title":"Nord. J. Comput."},{"key":"9377_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11750321_62","volume-title":"TAMC 2006: 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\u00a0T. In: Cai, J.-Y., et al. (eds.) TAMC 2006: Theory and Applications of Models of Computation. Lecture Notes in Computer Science, vol. 3959, pp.\u00a0654\u2013674. Springer, Berlin (2006)"},{"key":"9377_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11780342_30","volume-title":"CiE 2006: Logical Approaches to Computational Barriers","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies. In: Beckmann, A., et al. (eds.) CiE 2006: Logical Approaches to Computational Barriers. Lecture Notes in Computer Science, vol. 3988, pp.\u00a0279\u2013288. Springer, Berlin (2006)"},{"key":"9377_CR8","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/s00224-007-9021-x","volume":"43","author":"L. Kristiansen","year":"2008","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies induced by fragments of G\u00f6del\u2019s\u00a0T. Theory Comput. Syst. 43, 516\u2013554 (2008)","journal-title":"Theory Comput. Syst."},{"key":"9377_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-69407-6_37","volume-title":"CiE\u201908: Logic and Theory of Algorithms","author":"L. Kristiansen","year":"2008","unstructured":"Kristiansen, L.: Recursion in higher types and resource bounded turing machines. In: CiE\u201908: Logic and Theory of Algorithms. Lecture Notes in Computer Science, vol. 5028, pp.\u00a0336\u2013348. Springer, Berlin (2008)"},{"key":"9377_CR10","doi-asserted-by":"publisher","unstructured":"Kristiansen, L.: Higher types, finite domains and resource bounded Turing machines. J. Logic Comput. Adv. Access published online on February 17, 2010. doi: 10.1093\/logcom\/exq009","DOI":"10.1093\/logcom\/exq009"},{"key":"9377_CR11","unstructured":"Mender, B.: Master Thesis. University of Oslo. http:\/\/www.duo.uio.no\/sok\/work.html?WORKID=91952+"},{"key":"9377_CR12","first-page":"465","volume-title":"Proc. ACM Nat. Meeting","author":"A.R. Meyer","year":"1967","unstructured":"Meyer, A.R., Ritchie, D.M.: The complexity of loop programs. In: Proc. ACM Nat. Meeting, pp. 465\u2013469 (1967)"},{"key":"9377_CR13","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical recursion theory II. In: Studies in Logic and the Foundations of Mathematics, vol. 143. North-Holland, Amsterdam (1999)"},{"key":"9377_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"9377_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BFb0037119","volume-title":"Typed Lambda Calculi and Applications","author":"K. Sieber","year":"1993","unstructured":"Sieber, K.: Call-by-value and nondeterminism. In: Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 664, pp. 376\u2013390. Springer, Berlin (1993)"},{"key":"9377_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/6284","volume-title":"Domain-Theoretic Foundations of Functional Programming","author":"T. Streicher","year":"2006","unstructured":"Streicher, T.: Domain-Theoretic Foundations of Functional Programming. World Scientific, Singapore (2006)"},{"key":"9377_CR17","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1093\/comjnl\/35.5.514","volume":"35","author":"H. S\u00f8ndergaard","year":"1992","unstructured":"S\u00f8ndergaard, H., Sestoft, P.: Non-determinism in Functional Languages. Comput. J. 35, 514\u2013523 (1992)","journal-title":"Comput. J."},{"key":"9377_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0049-237X(08)70853-X","volume-title":"Proceedings of the Second Scandinavian Logic Symposium","author":"W.W. Tait","year":"1971","unstructured":"Tait, W.W.: Normal form theorem for barrecursive functions of finite type. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, pp.\u00a0353\u2013367. North-Holland, Amsterdam (1971)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9377-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9377-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9377-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9377-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:23Z","timestamp":1558698863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9377-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,24]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9377"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9377-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,24]]}}}