Classical and Intuitionistic Logic Are Asymptotically Identical-Reference-Cited by-同舟云学术

Classical and Intuitionistic Logic Are Asymptotically Identical

Published:2007 Issue: Volume: Page:177-193
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74915-8_16

Reference13 articles.

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)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotic comparison of the implicative fragments of certain fuzzy logics;2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE);2022-07-18

2. Almost all Classical Theorems are Intuitionistic;RAIRO - Theoretical Informatics and Applications;2022

3. A note on the asymptotic expressiveness of ZF and ZFC;Journal of Logic and Computation;2021-06-21

4. Arbres, algorithmes et données;Arbres pour l’Algorithmique;2018

5. On the likelihood of normalization in combinatory logic;Journal of Logic and Computation;2017-02-25