MLQ
2010
13 years 3 months ago
2010
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...