{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T23:40:26Z","timestamp":1737157226481,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72734-7_20","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"284-292","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Rewriting Proofs and Fibonacci Numbers"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"The Theory of Partitions","author":"G.E. Andrews","year":"1998","unstructured":"Andrews, G.E.: The Theory of Partitions. Cambridge University Press, Cambridge (1998)"},{"key":"20_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"20_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, volume B, pp. 243\u2013320. Elsevier, Amsterdam (1990)"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1073\/pnas.78.4.2026","volume":"78","author":"A.M. Garsia","year":"1981","unstructured":"Garsia, A.M., Milne, S.C.: Method for constructing bijections for classical partition identities. Proc. Nat. Acad. Sci. U.S.A.\u00a078(4), 2026\u20132028 (1981)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(83)90043-2","volume":"34","author":"B. Gordon","year":"1983","unstructured":"Gordon, B.: Sieve-equivalence and explicit bijections. J. Combin. Theory Ser. A\u00a034(1), 90\u201393 (1983)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0097-3165(88)90026-X","volume":"49","author":"K.M. O\u2019Hara","year":"1988","unstructured":"O\u2019Hara, K.M.: Bijections for partition identities. J. Combin. Theory Ser. A\u00a049(1), 13\u201325 (1988)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1-3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.disc.2004.01.017","volume":"285","author":"M. Kanovich","year":"2004","unstructured":"Kanovich, M.: Finding direct partition bijections by two-directional rewriting techniques. Discrete Mathematics\u00a0285(1-3), 151\u2013166 (2004), The preliminary version: Bijections between partitions by two-directional rewriting techniques. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 44\u201358. Springer, Heidelberg (2002)","journal-title":"Discrete Mathematics"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kanovich, M.: The two-way rewriting in action: Removing the mystery of Euler-Glaisher\u2019s map. Discrete Mathematics (2006), doi:10.1016\/j.disc.2006.10.005","DOI":"10.1016\/j.disc.2006.10.005"},{"key":"20_CR9","first-page":"1","volume-title":"Handbook of Logic in Computer Science, vol.\u00a02","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, New York (1992)"},{"key":"20_CR10","volume-title":"The Art of Computer Programming, vol. 2: Seminumerical Algorithms","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading (1997)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0097-3165(82)90040-1","volume":"33","author":"J.B. Remmel","year":"1982","unstructured":"Remmel, J.B.: Bijective proofs of some classical partition identities. J. Combin. Theory Ser. A\u00a033, 273\u2013286 (1982)","journal-title":"J. Combin. Theory Ser. A"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0097-3165(83)90042-0","volume":"34","author":"H.S. Wilf","year":"1983","unstructured":"Wilf, H.S.: Sieve equivalence in generalized partition theory. J. Combin. Theory Ser. A\u00a034, 80\u201389 (1983)","journal-title":"J. Combin. Theory Ser. A"},{"key":"20_CR13","unstructured":"Wilf, H.S.: Lectures on Integer Partitions. University of Victoria, Victoria, B.C., Canada (2000), http:\/\/cis.upenn.edu\/~wilf"},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/00150517.1972.12430909","volume":"10","author":"E. Zeckendorf","year":"1972","unstructured":"Zeckendorf, E.: A Generalized Fibonacci Numeration. Fibonacci Quarterly\u00a010, 365\u2013372 (1972)","journal-title":"Fibonacci Quarterly"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T23:03:32Z","timestamp":1737155012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727323","9783540727347"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}