Classical and Intuitionistic Logic Are Asymptotically Identical
暂无分享,去创建一个
[1] Hanno Lefmann,et al. Some Typical Properties of Large AND/OR Boolean Formulas , 1995, MFCS.
[2] Marek Zaionc,et al. Probability distribution for simple tautologies , 2006, Theor. Comput. Sci..
[3] Danièle Gardy,et al. And/or tree probabilities of Boolean functions , 2005 .
[4] Morten Heine Sørensen,et al. Chapter 4 - The Curry-Howard isomorphism , 2006 .
[5] Philippe Flajolet,et al. And/Or Trees Revisited , 2004, Comb. Probab. Comput..
[6] Marek Zaionc. On the Asymptotic Density of Tautologies in Logic of Implication and Negation , 2005, Reports Math. Log..
[7] Philippe Flajolet,et al. Analytic combinatorics : functional equations, rational and algebraic functions , 2001 .
[8] Jerzy Tyszkiewicz,et al. Statistical properties of simple types , 2000, Mathematical Structures in Computer Science.
[9] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[10] Zofia Kostrzycka,et al. Statistics of Intuitionistic versus Classical Logics , 2004, Stud Logica.
[11] Danièle Gardy. Random Boolean expressions , 2005 .
[12] Grzegorz Matecki,et al. Asymptotic Density for Equivalence , 2005, CLA.
[13] Danièle Gardy. Random Boolean expressions , 2005 .