Quantitative logic

• O. Bodini, D. Gardy, B. Gittenberger and Z. Gołębiewski. On the number of unary-binary tree-like structures with restrictions on the unary height. Annals of Combinatorics 22, pp. 45--91, 2018.
• É. de Panafieu, D. Gardy, B. Gittenberger and M. Kuba. 2-XOR revisited: satisfiability and probabilities of functions. Algorithmica, Vol. 76 (4), pp. 1035--1076. 2016. doi:10.1007/s00453-016-0119-x
• É. de Panafieu, D. Gardy, B. Gittenberger and M. Kuba. Probabilities of 2-XOR functions. LATIN 14, Lecture Notes in Computer Science (LNCS), 8392:454-465, Springer, Berlin, 2014.
• O. Bodini, D. Gardy, B. Gittenberger and A. Jacquot. Enumeration of generalized BCi lambda-terms. Electronic Journal of Combinatorics, 20, article P30, 23pp. (electronic), 2013.
• O. Bodini, D. Gardy and A. Jacquot. Asymptotics and random sampling for BCI and BCK lambda terms. TCS, 2013, doi: 10.1016/j.tcs.2013.01.008
• D. Gardy. Arbres pour la logique. Ecole d'automne ADAMA, Madhia (Tunisie), 17-21 Octobre 2012.
• O. Bodini, D. Gardy and B. Gittenberger. Lambda-terms of bounded unary height. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2011, San Francisco (USA).
• O. Bodini, D, Gardy and A. Jacquot. Asymptotics and random sampling for formulae in intuitionnistic logical systems. 7th GASCOM (Génération Aléatoire de Structures COMbinatoires), September 2010, Montréal (Canada)
• H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms 40(3), May 2012, 317–349.
• B. Chauvin, D. Gardy and C. Mailler. The growing tree distribution on Boolean functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2011, San Francisco (USA).
• H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. Tautologies over implication with negative literals. Math. Log. Quart. 56 (3), 2010.
• H. Fournier, D. Gardy and A. Genitrini. Balanced And/Or trees and linear threshold functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2009, New York (USA).
• H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. Complexity and limiting ratio of boolean functions over implication. MFCS'08, Torun (Pologne), Août 2008.
• D. Gardy. Expressions booléennes aléatoires; application à la probabilité et complexité ­de fonctions booléennes. Exposé invité, journées du GDR IM, Paris, 24-25 Janvier 2008.
• H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. Classical and intuitionnistic logics are asymptotically identical. Computer Science Logic'07, proceedings in LNCS 4646, pp. 177-193, 2007.
• D. Gardy. Random Boolean expressions. Invited paper, Colloquium on Computational Logic and Applications, Chambéry, Juin 2005. DMTCS Proceedings AF, pp. 1-36 R. David, D. Gardy, P. Lescanne, M. Zaionc (eds).
• D. Gardy and A. Woods. Lower bounds on probabilities for Boolean functions. First Intern. Conf. on the Analysis of Algorithms, Barcelona, Spain, June 2005. DMTCS Proceedings, vol. AD(2005), pp. 139-146, C. Martinez (ed.).
• B. Chauvin, P. Flajolet, D. Gardy and B. Gittenberger. And/Or trees revisited. Combinatorics, Probability and Computing, Vol. 13 No. 4-5, (2004) 475-487.