{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:55Z","timestamp":1725489355814},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_27","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"359-373","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum Length of Mu-Reduction in Lambda Mu-Calculus"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Tatsuta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.2178\/jsl\/1067620187","volume":"68","author":"R. David","year":"2003","unstructured":"David, R., Nour, K.: A short proof of the strong normalization of classical natural deduction with disjunction. Journal of Symbolic Logic\u00a068(4), 1277\u20131288 (2003)","journal-title":"Journal of Symbolic Logic"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/11417170_13","volume-title":"Typed Lambda Calculi and Applications","author":"R. David","year":"2005","unstructured":"David, R., Nour, K.: Arithmetical Proofs of Strong Normalization Results for the Symmetric \u03bb\u03bc-Calculus. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 162\u2013178. Springer, Heidelberg (2005)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-45413-6_17","volume-title":"Typed Lambda Calculi and Applications","author":"P. Groote de","year":"2001","unstructured":"de Groote, P.: Strong normalization of classical natural deduction with disjunction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 182\u2013196. Springer, Heidelberg (2001)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/inco.2002.3147","volume":"178","author":"P. Groote de","year":"2002","unstructured":"de Groote, P.: On the strong normalisation of intuitionistic natural deduction with permutation-conversions. Information and Computation\u00a0178, 441\u2013464 (2002)","journal-title":"Information and Computation"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00153-002-0156-9","volume":"42","author":"F. Joachimski","year":"2003","unstructured":"Joachimski, F., Matthes, R.: Short proofs of normalization for the simply-typed lambda-calculus, permutative conversions and G\u00f6del\u2019s T. Archive for Mathematical Logic\u00a042, 59\u201387 (2003)","journal-title":"Archive for Mathematical Logic"},{"issue":"1-3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.apal.2004.10.009","volume":"133","author":"R. Matthes","year":"2005","unstructured":"Matthes, R.: Non-strictly positive fixed-points for classical natural deduction. Annals of Pure and Applied Logic\u00a0133(1-3), 205\u2013230 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"851","DOI":"10.2178\/jsl\/1058448444","volume":"68","author":"K. Nakazawa","year":"2003","unstructured":"Nakazawa, K., Tatsuta, M.: Strong normalization proof with CPS-translation for second order classical natural deduction. Journal of Symbolic Logic\u00a068(4), 851\u2013859 (2003)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00153-005-0314-y","volume":"45","author":"K. Nour","year":"2006","unstructured":"Nour, K., Saber, K.: A semantical proof of the strong normalization theorem for full propositional classical natural deduction. Archive for Mathematical Logic\u00a045(3), 357\u2013364 (2006)","journal-title":"Archive for Mathematical Logic"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.2307\/2275652","volume":"62","author":"M. Parigot","year":"1997","unstructured":"Parigot, M.: Strong normalization for second order classical natural deduction. Journal of Symbolic Logic\u00a062(4), 1461\u20131479 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"27_CR10","unstructured":"Prawitz, D.: Natural Deduction. Almquist and Wiksell (1965)"},{"issue":"1-2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.apal.2005.05.009","volume":"136","author":"M. Tatsuta","year":"2005","unstructured":"Tatsuta, M., Mints, G.: A simple proof of second-order strong normalization with permutative conversions. Annals of Pure and Applied Logic\u00a0136(1-2), 134\u2013155 (2005)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:36Z","timestamp":1619518356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}