Abstract
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in the naming of variables are identical. For every n εℕ, there is a finite number of different formulas of size n. For every n we consider the proportion between the number of intuitionistic tautologies of size n compared with the number of classical tautologies of size n. We prove that the limit of that fraction is 1 when n tends to infinity.
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 and Computing 13(4-5), 475–497 (2004)
Flajolet, P., Sedgewick, R.: Analytic combinatorics: functional equations, rational and algebraic functions. In: INRIA, vol. 4103 (2001)
Flajolet, P., Sedgewick, R.: Analytic combinatorics. Book in preparation (2007), available at: http://algo.inria.fr/flajolet/Publications/books.html
Gardy, D.: Random Boolean expressions. In: Colloquium on Computational Logic and Applications. Proceedings in DMTCS, Chambery (France), June 2005, pp. 1–36 (2006)
Gardy, D., Woods, A.: And/or tree probabilities of Boolean function. Discrete Mathematics and Theoretical Computer Science, 139–146 (2005)
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)
Kostrzycka, Z., Zaionc, M.: Statistics of intuitionistic versus classical logic. Studia Logica 76(3), 307–328 (2004)
Lefmann, H., Savický, P.: Some typical properties of large And/Or Boolean formulas. Random Structures and Algorithms 10, 337–351 (1997)
Matecki, G.: Asymptotic density for equivalence. Electronic Notes in Theoretical Computer Science 140, 81–91 (2005)
Moser, L., Wyman, M.: An asymptotic formula for the Bell numbers, Transactions of the Royal Society of Canada, XLIX (1955)
Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Mathematical Structures in Computer Science 10(5), 575–594 (2000)
Wilf, H.: generating functionology, 3rd edn. A K Peters Publishers (2006)
Zaionc, M.: On the asymptotic density of tautologies in logic of implication and negation. Reports on Mathematical Logic 39, 67–87 (2005)
Zaionc, M.: Probability distribution for simple tautologies. Theoretical Computer Science 355(2), 243–260 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genitrini, A., Kozik, J., Zaionc, M. (2008). Intuitionistic vs. Classical Tautologies, Quantitative Comparison. In: Miculan, M., Scagnetto, I., Honsell, F. (eds) Types for Proofs and Programs. TYPES 2007. Lecture Notes in Computer Science, vol 4941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68103-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68103-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68084-0
Online ISBN: 978-3-540-68103-8
eBook Packages: Computer ScienceComputer Science (R0)