{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:33:24Z","timestamp":1743136404237,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022722"},{"type":"electronic","value":"9783642022739"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02273-9_28","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T10:12:17Z","timestamp":1246011137000},"page":"386-400","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of G\u00f6del\u2019s T in \u03bb-Formulation"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Wilken","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Weiermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/1521-3870(200010)46:4<517::AID-MALQ517>3.0.CO;2-A","volume":"46","author":"A. Beckmann","year":"2000","unstructured":"Beckmann, A., Weiermann, A.: Analyzing G\u00f6del\u2019s T via Expanded Head Reduction Trees. Mathematical Logic Quarterly\u00a046, 517\u2013536 (2000)","journal-title":"Mathematical Logic Quarterly"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/malq.19940400212","volume":"40","author":"W. Buchholz","year":"1994","unstructured":"Buchholz, W., Cichon, E.A., Weiermann, A.: A Uniform Approach to Fundamental Sequences and Hierarchies. Mathematical Logic Quarterly\u00a040, 273\u2013286 (1994)","journal-title":"Mathematical Logic Quarterly"},{"key":"28_CR3","unstructured":"Cardone, F., Hindley, J.R.: History of \u03bb-Calculus and Combinatory Logic. In: Gabbay, D.M., Woods, J. (eds.) Handbook of the History of Logic, vol.\u00a05. Elsevier, Amsterdam (to appear)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","volume":"12","author":"K. G\u00f6del","year":"1958","unstructured":"G\u00f6del, K.: \u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes. Dialectica\u00a012, 280\u2013287 (1958)","journal-title":"Dialectica"},{"key":"28_CR5","series-title":"Intuitionism and Proof Theory","first-page":"443","volume-title":"Assignment of Ordinals to Terms For Primitive Recursive Functionals of Finite Type","author":"W.A. Howard","year":"1970","unstructured":"Howard, W.A.: Assignment of Ordinals to Terms For Primitive Recursive Functionals of Finite Type. Intuitionism and Proof Theory, pp. 443\u2013458. North Holland, Amsterdam (1970)"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.2307\/2272731","volume":"37","author":"C. Parsons","year":"1972","unstructured":"Parsons, C.: On n-Quantifier Induction. The Journal of Symbolic Logic\u00a037(3), 466\u2013482 (1972)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-66473-1","volume-title":"Proof Theory","author":"K. Sch\u00fctte","year":"1977","unstructured":"Sch\u00fctte, K.: Proof Theory. Springer, Heidelberg (1977)"},{"key":"28_CR8","volume-title":"Mathematical Logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, New York (1967)"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.2307\/2586654","volume":"63","author":"A. Weiermann","year":"1998","unstructured":"Weiermann, A.: How Is it That Infinitary Methods Can Be Applied to Finitary Mathematics? G\u00f6del\u2019s T: A Case Study. The Journal of Symbolic Logic\u00a063(4), 1348\u20131370 (1998)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02273-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T19:41:55Z","timestamp":1552074115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02273-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022722","9783642022739"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02273-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}