Abstract
Canonical expressions represent the implicative propositions (i.e., the propositions with only implications) up-to renaming of variables. Using a Monte-Carlo approach, we explore the model of canonical expressions in order to confirm the paradox that says that asymptotically almost all classical theorems are intuitionistic. Actually we found that more than 96.6% of classical theorems are intuitionistic among propositions of size 100.
Subject
Computer Science Applications,General Mathematics,Software
Reference18 articles.
1. Barendregt H.P., Dekkers W. and Statman R., Lambda Calculus with Types. Perspectives in Logic. Cambridge University Press (2013).
2. Biere A., Heule M.J.H., van Maaren H. and Walsh T. (Eds.), Handbook of satisfiability. Vol. 185 of Frontiers in Artificial Intelligence and Applications. IOS Press (2009).
3. Bright C., Gerhard J., Kotsireas I.S. and Ganesh V., Effective problem solving using SAT solvers, in edited by Gerhard J. and Kotsireas I.S. Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings, Vol. 1125 of Communications in Computer and Information Science (Springer 2019) 205–219.
4. Cook S.A., The complexity of theorem-proving procedures. in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA, edited by Harrison M.A., Banerji R.B. and Ullman J.D.. ACM (1971) 151–158.
5. Flajolet P. and Sedgewick R., Analytic Combinatorics. Cambridge University Press (2008).