On the share of closed IL formulas which are also in GL
Vedran \v{C}a\v{c}i\'c, Vjekoslav Kova\v{c}

TL;DR
This paper quantifies how many closed Intuitionistic Logic (IL) formulas are equivalent to General Logic (GL) formulas, showing that most have the same normal forms as GL formulas through a syntactical approach.
Contribution
It provides an asymptotic analysis of classes of closed IL formulas and introduces a new method for computing their asymptotic behaviors based on grammar rules.
Findings
Most closed IL formulas have GL-equivalents.
The majority of formulas share the same normal forms as GL formulas.
A new syntactical method for asymptotic analysis of formulas.
Abstract
Normal forms for wide classes of closed IL formulas were given in [4]. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the "majority" of closed IL formulas have GL-equivalents, and by that, they have the same normal forms as GL formulas. Our approach is entirely syntactical, except for applying the results of [4]. As a byproduct we devise a convenient way of computing asymptotic behaviors of somewhat general classes of formulas given by their grammar rules. Its applications do not require any knowledge of the recurrence relations, generating functions, or the asymptotic enumeration methods, as all these are incorporated into two fundamental parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
