B. Chauvin, B. Flajolet, P. Gardy, D. Gittenberger, and B. , And/Or Trees Revisited, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.475-497, 2004.
DOI : 10.1017/S0963548304006273

P. Flajolet and R. Sedgewick, Analitic combinatorics: functional equations, rational and algebraic functions, 2001.

P. Flajolet and A. M. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

H. Fournier, D. Gardy, A. Genitrini, and M. Zaionc, Classical and Intuitionistic Logic Are Asymptotically Identical, Lecture Notes in Computer Science, vol.4646, pp.177-193
DOI : 10.1007/978-3-540-74915-8_16
URL : https://hal.archives-ouvertes.fr/hal-00530534

D. Gardy and A. R. Woods, And/or tree probabilities of Boolean functions, pp.139-146, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184027

Z. Kostrzycka, On the density of truth of implicational parts of intuitionistic and classical logics, Journal of Applied Non-Classical Logics, vol.23, issue.3-4, pp.295-325, 2003.
DOI : 10.3166/jancl.13.391-421

Z. Kostrzycka and M. Zaionc, Statistics of Intuitionistic versus Classical Logics, Studia Logica, vol.76, issue.3, pp.307-328, 2004.
DOI : 10.1023/B:STUD.0000032101.88511.93

Z. Kostrzycka and M. Zaionc, Asymptotic Densities in Logic and Type Theory, Studia Logica, vol.140, issue.1-2, pp.385-403, 2008.
DOI : 10.1016/j.entcs.2005.06.025

H. Lefmann and P. Savick´ysavick´y, Some typical properties of large and/or boolean formulas,Random Structures and Algorithms, pp.337-351, 1997.

G. Mints, A Short Introduction to Intuitionistic Logic. The University Series in Mathematics, 2000.

M. Moczurad, J. Tyszkiewicz, and M. Zaionc, Statistical properties of simple types, Mathematical Structures in Computer Science, vol.10, issue.5, pp.575-594, 2000.
DOI : 10.1017/S0960129599002959

A. R. Woods, Coloring Rules for Finite Trees, and Probabilities of Monadic Second Order Sentences, Random Structures Algorithms 10, pp.453-485, 1997.