If we enumerate the statements we can prove as decidable with proof or negation and enumerate the statements we can prove as undecidable, with satisfiability, forcing, or an incompleteness proof, is it known if the ratio of provably decidable statements to provably undecidable statements goes to zero or infinity? Or does the unknowable number of unprovably undecidable statements (from Church's theorem I believe there must be statements that are unprovably undecidable) make this question unanswerable?
My intuition suggests that the larger the quantifier rank, the more likely it is to be undecidable.