Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System

Authors:
Antoine Genitrini;Jakub Kozik
Affiliations:
PRiSM, CNRS UMR 8144, Université de Versailles Saint-Quentin, Versailles cedex, France 78035;Theoretical Computer Science, Jagiellonian University, Kraków, Poland 30-348
Venue:
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Year:
2009

Citing 7
Cited 2

Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Statistical properties of simple types

Mathematical Structures in Computer Science
And/Or Trees Revisited

Combinatorics, Probability and Computing
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Analytic Combinatorics

Analytic Combinatorics
Intuitionistic vs. classical tautologies, quantitative comparison

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Classical and intuitionistic logic are asymptotically identical

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

The fraction of large random trees representing a given Boolean function in implicational logic

Random Structures & Algorithms
Asymptotics and random sampling for BCI and BCK lambda terms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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".