{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:05:49Z","timestamp":1742947549646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_7","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"62-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Asymptotic Properties of Combinatory Logic"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Bendkowski","sequence":"first","affiliation":[]},{"given":"Katarzyna","family":"Grygiel","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Zaionc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"7_CR1","unstructured":"Barendregt, H.P., Bergstra, J., Klop, J.W., Volken, H.: Some notes on lambda reduction, in: Degrees, reductions and representability in the lambda calculus. Preprint no. 22, University of Utrecht, Department of mathematics, pp. 13\u201353 (1976)"},{"issue":"4\u20135","key":"7_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0963548304006273","volume":"13","author":"B Chauvin","year":"2004","unstructured":"Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And\/Or trees revisited. Comb. Probab. Comput. 13(4\u20135), 475\u2013497 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"7_CR3","volume-title":"Combinatory Logic","author":"H Curry","year":"1958","unstructured":"Curry, H., Feys, R.: Combinatory Logic, vol. I. North Holland, Amsterdam (1958)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(1:2)2013","volume":"9","author":"R David","year":"2013","unstructured":"David, R., Grygiel, K., Kozik, J., Raffalli, C., Theyssier, G., Zaionc, M.: Asymptotically almost all $$\\lambda $$-terms are strongly normalizing. Logical Methods Comput. Sci. 9, 1\u201330 (2013)","journal-title":"Logical Methods Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-74915-8_16","volume-title":"Computer Science Logic","author":"H Fournier","year":"2007","unstructured":"Fournier, H., Gardy, D., Genitrini, A., Zaionc, M.: Classical and intuitionistic logic are asymptotically identical. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 177\u2013193. Springer, Heidelberg (2007)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gardy, D. Random boolean expressions. In: Discrete Mathematics and Theoretical Computer Science Proceedings AF, pp.1\u201336 (2005)","DOI":"10.46298\/dmtcs.3475"},{"key":"7_CR8","first-page":"139","volume":"6","author":"D Gardy","year":"2005","unstructured":"Gardy, D., Woods, A.: And\/Or tree probabilities of boolean functions. Discrete Math. Theor. Comput. Sci. 6, 139\u2013146 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"7","key":"7_CR9","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.apal.2011.09.011","volume":"163","author":"A Genitrini","year":"2012","unstructured":"Genitrini, A., Kozik, J.: In the full propositional logic, 5\/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Logic 163(7), 875\u2013887 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Grygiel, K., and Lescanne, P. Counting terms in the binary lambda calculus. In: DMTCS 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014)","DOI":"10.1017\/S0956796815000271"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:STUD.0000032101.88511.93","volume":"76","author":"Z Kostrzycka","year":"2004","unstructured":"Kostrzycka, Z., Zaionc, M.: Statistics of intuitionistic versus classical logic. Stud. Logica 76(3), 307\u2013328 (2004)","journal-title":"Stud. Logica"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kozik, J.: Subcritical pattern languages for And\/Or trees. In: DMTCS Proceedings from Fifth Colloquium on Mathematics and Computer Science Algorithms Trees, Combinatorics and Probabilities, pp. 437\u2013448 (2008)","DOI":"10.46298\/dmtcs.3582"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<337::AID-RSA4>3.0.CO;2-X","volume":"10","author":"H Lefmann","year":"1997","unstructured":"Lefmann, H., Savick\u00fd, P.: Some typical properties of large And\/Or Boolean formulas. Random Struct. Algorithms 10, 337\u2013351 (1997)","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"7_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1017\/S0960129599002959","volume":"10","author":"M Moczurad","year":"2000","unstructured":"Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Math. Struct. Comput. Sci. 10(5), 575\u2013594 (2000)","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR15","first-page":"4","volume":"20","author":"B Olivier","year":"2013","unstructured":"Olivier, B., Dani\u00e8le, G., Bernhard, G., Alice, J.: Enumeration of generalized BCI lambda-terms. Electr. J. Comb. 20, 4 (2013)","journal-title":"Electr. J. Comb."},{"key":"7_CR16","first-page":"413","volume":"23","author":"G Szeg\u00f6","year":"1967","unstructured":"Szeg\u00f6, G.: Orthogonal polynomials. Am. Math. Soc. Colloquium Ser. Publ. 23, 413\u2013421 (1967)","journal-title":"Am. Math. Soc. Colloquium Ser. Publ."},{"key":"7_CR17","unstructured":"Tromp, J. Binary lambda calculus and combinatory logic. Unpublished manuscript (2014). http:\/\/tromp.github.io\/cl\/LC.pdf."},{"key":"7_CR18","volume-title":"Generating Functionology","author":"H Wilf","year":"1994","unstructured":"Wilf, H.: Generating Functionology. Academic Press, Boston (1994)"},{"key":"7_CR19","first-page":"3","volume":"12","author":"A Woods","year":"2006","unstructured":"Woods, A.: On the probability of absolute truth for And\/Or formulas. Bull. Symbolic Logic 12, 3 (2006)","journal-title":"Bull. Symbolic Logic"},{"key":"7_CR20","first-page":"67","volume":"39","author":"M Zaionc","year":"2005","unstructured":"Zaionc, M.: On the asymptotic density of tautologies in logic of implication and negation. Rep. Math. Logic 39, 67\u201387 (2005)","journal-title":"Rep. Math. Logic"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2006.01.002","volume":"355","author":"M Zaionc","year":"2006","unstructured":"Zaionc, M.: Probability distribution for simple tautologies. Theor. Comput. Sci. 355(2), 243\u2013260 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:22:48Z","timestamp":1676445768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}