Abstract
We address the problem of quantitative comparison of classical and intuitionistic logics within the language of the full propositional system. We apply two different approaches, to estimate the asymptotic fraction of intuitionistic tautologies among classical tautologies, obtaining the same results for both. Our results justify informal statements such as “about 5/8 of classical tautologies are intuitionistic”.
Research described in this paper was partially supported by the A.N.R. project SADA, French government research grant for young scientists (program number 0185) and by POLONIUM grant Quantitative research in logic and functional languages, cooperation between Jagiellonian University of Krakow, L’ École Normale Supérieure de Lyon and L’Université de Versailles Saint-Quentin, contract number 7087/R07/R08.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And/or trees revisited. Combinatorics, Probability & Computing 13 (2004)
Flajolet, P., Sedgewick, R.: Analytic combinatorics, in preparation, preprint (2008), http://algo.inria.fr/flajolet/Publications/book.pdf
Fournier, H., Gardy, D., Genitrini, A., Zaionc, M.: Classical and intuitionistic logic are asymptotically identical. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 177–193. Springer, Heidelberg (2007)
Genitrini, A., Kozik, J., Zaionc, M.: Intuitionistic vs classical tautologies, quantitative comparison. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 100–109. Springer, Heidelberg (2008)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics: a foundation for computer science. Addison-Wesley Longman Publishing Co., Boston (1989)
Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Mathematical Structures in Computer Science 10(5), 575–594 (2000)
Moser, L., Wyman, M.: An asymptotic formula for the bell numbers. Transactions of the Royal Society of Canada XLIX (1955)
Sorensen, M., Urzyczyn, P.: Lectures on the curry-howard isomorphism (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genitrini, A., Kozik, J. (2008). Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System . In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-92687-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92686-3
Online ISBN: 978-3-540-92687-0
eBook Packages: Computer ScienceComputer Science (R0)