Classical and intuitionistic logic are asymptotically identical

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 177-193

  Fournier, Hervé ^a   Gardy, Danièle ^a   Genitrini, Antoine ^a   Zaionc, Marek ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Analytic combinatorics; Implicational formulas; Intuitionistic logic; Tautologies

Indexed keywords

COMBINATORIAL MATHEMATICS; PROBLEM SOLVING;

ANALYTIC COMBINATORICS; IMPLICATIONAL FORMULAS; INTUITIONISTIC LOGIC; TAUTOLOGIES;

ASYMPTOTIC ANALYSIS;

EID: 38049089487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_16     Document Type: Conference Paper

References (13)

1. Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And/Or trees revisited. Combinatorics, Probability and Computing 13(4-5), 475-497 (2004)
2. Flajolet, P., Sedgewick, R.: Analytic combinatorics: functional equations, rational and algebraic functions, INRIA, Number 4103 (2001)
3. Flajolet, P., Sedgewick, R.: Analytic combinatorics. Book in preparation (2007), available at http://algo.inria.fr/flajolet/Publications/books.html
4. Gardy, D.: Random Boolean expressions, Colloquium on Computational Logic and Applications. In: Proceedings in DMTCS, Chambery (France), June 2005, pp. 1-36 (2006)
5. Gardy, D., Woods, A.: And/or tree probabilities of Boolean function. Discrete Mathematics and Theoretical Computer Science , 139-146 (2005)
6. Kostrzycka, Z., Zaionc, M.: Statistics of intuitionnistic versus classical logic. Studia Logica 76(3), 307-328 (2004)
7. Lefmann, H., Savickỳ, P.: Some typical properties of large And/Or Boolean formulas. Random Structures and Algorithms 10, 337-351 (1997)
8. Matecki, G.: Asymptotic density for equivalence. Electronic Notes in Theoretical Computer Science 140, 81-91 (2005)
9. Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Mathematical Structures in Computer Science 10(5), 575-594 (2000)
10. Sørensen, M., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Studies in Logic and the Foundations of Mathematics 149 (2006)
11. Wilf, H.: Generatingfunctionology, 2nd edn. Academic Press, Boston (1994)
12. Zaionc, M.: On the asymptotic density of tautologies in logic of implication and negation. Reports on Mathematical Logic 39, 67-87 (2005)
13. Zaionc, M.: Probability distribution for simple tautologies. Theoretical Computer Science 355(2), 243-260 (2006)