A. Brodsky and N. Pippenger, The Boolean functions computed by random Boolean formulas, or, how to grow the right function. Random Structures and Algorithms, pp.490-519, 2005.

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

B. Chauvin, D. Gardy, and A. Woods, Commutative and associative tree representations for Boolean functions, 2006.

M. Drmota, Systems of functional equations. Random Structures and Algorithms, pp.103-124, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01197227

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Flajolet, E. Fusy, and C. Pivoteau, Boltzmann sampling of unlabelled structures Submitted for publication. Available on the web at the site http, 2006.

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

P. Flajolet and R. Sedgewick, Analytic Combinatorics Available on the web at the site http, 2006.

D. Gardy and A. Woods, Lower bounds on probabilities for Boolean functions, First International Conference on the Analysis of Algorithms, pp.139-146, 2005.

D. H. Greene and D. E. Knuth, Mathematics for the analysis of algorithms, Birkhäuser, 1981.
DOI : 10.1007/978-0-8176-4729-2

M. A. Harrison, The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation, IEEE Transactions on Electronic Computers, vol.12, issue.5, pp.559-561, 1963.
DOI : 10.1109/PGEC.1963.263656

M. A. Harrison, Counting theorems and their applications to classification of switching functions Recent developments in switching theory, pp.85-120, 1971.

P. Henrici, Applied and computational analysis, 1974.

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, 2003.
DOI : 10.3166/jancl.13.391-421

Z. Kostrzycka, On the density of truth in Grzegorczyck's modal logic, Bulletin of the Section of Logic, vol.33, issue.2, pp.107-120, 2004.

Z. Kostrzycka, On the density of truth in modal logics, In Mathematics and Computer Science, 2006.

Z. Kostrzycka and M. Zaionc, On the density of truth in Dummett's logic. Bulletin of the section of logic, pp.43-55, 2003.

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

S. P. Lalley, Finite Range Random Walk on Free Groups and Homogeneous Trees, The Annals of Probability, vol.21, issue.4, pp.2087-2130, 1993.
DOI : 10.1214/aop/1176989012

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

O. B. Lupanov, Complexity of formula realization of functions of logical algebra English translation: Problems of Cybernetics, Problemy Kibernetiki, vol.3, issue.3, pp.61-80782, 1960.

O. B. Lupanov, ?. , ?. , and ¬. P. Kibernetiki, On the realization of functions of logical algebra by formulae of finite classes (formulae of limited depth) in the basis English translation: Problems of Cybernetics, pp.5-141, 1961.

J. Marckert, Mouvement brownien et arbre continu Notes for a graduate course Available on the web at the site http, 2003.

G. Matecki, Asymptotic Density for Equivalence, Electronic Notes in Theoretical Computer Science, vol.140, pp.81-91, 2005.
DOI : 10.1016/j.entcs.2005.06.022

A. Meir and J. W. Moon, On the altitude of nodes in random trees, Journal canadien de math??matiques, vol.30, issue.5, pp.997-1015, 1978.
DOI : 10.4153/CJM-1978-085-0

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

R. Otter, The Number of Trees, The Annals of Mathematics, vol.49, issue.3, pp.583-599, 1948.
DOI : 10.2307/1969046

J. B. Paris, A. Vencovská, and G. M. Wilmers, A natural prior probability distribution derived from the propositional calculus, Annals of Pure and Applied Logic, vol.70, issue.3, pp.243-285, 1994.
DOI : 10.1016/S0168-0072(94)90011-6

Y. Peres, Probability on Trees: An Introductory Climb, Notes from the St-Flour, pp.193-280, 1997.
DOI : 10.1007/978-3-540-48115-7_3

G. Pólya and R. C. Read, Combinatorial enumeration of Groups, Graphs and Chemical Compounds, 1987.
DOI : 10.1007/978-1-4612-4664-0

J. Riordan and C. E. Shannon, The Number of Two-Terminal Series-Parallel Networks, Journal of Mathematics and Physics, vol.21, issue.1-4, pp.83-93, 1942.
DOI : 10.1002/sapm194221183

P. Savick, Random boolean formulas representing any boolean function with asymptotically equal probability, Discrete Mathematics, vol.83, issue.1, pp.95-103, 1990.
DOI : 10.1016/0012-365X(90)90223-5

P. Savick´ysavick´y, Complexity and Probability of Some Boolean Formulas, Combinatorics, Probability and Computing, vol.7, issue.4, pp.451-463, 1998.
DOI : 10.1017/S0963548398003630

P. Savick´ysavick´y and A. Woods, The number of Boolean functions computed by formulas of a given size. Random Structures and Algorithms, pp.349-382, 1998.

R. Sedgewick and P. Flajolet, An introduction to the Analysis of Algorithms, 1996.

L. Valiant, Short monotone formulae for the majority function, Journal of Algorithms, vol.5, issue.3, pp.363-366, 1984.
DOI : 10.1016/0196-6774(84)90016-6

D. Villa-monteiro, Expressions Booléennes aléatoires, 2005.

I. Wegener, The complexity of Boolean functions, 1987.

A. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences. Random Structures and Algorithms, pp.453-485, 1997.

M. Zaionc, On the density of truth in logic of implication and negation, 2002.

M. Zaionc, Statistics of implicational logic, Electronic Notes in Theoretical Computer Science, vol.84, 2003.

M. Zaionc, On the asymptotic density of tautologies in logic of implication and negation, Reports on Mathematical Logic, vol.39, pp.67-87, 2005.

M. Zaionc, Probability distribution for simple tautologies, Theoretical Computer Science, vol.355, issue.2, pp.243-260, 2006.
DOI : 10.1016/j.tcs.2006.01.002