This project deals with analytical methods for attacking a number of combinatorial problems arising from logic. The goal is to develop systematic tools for deriving asymptotic formulas for counting functions of proof-theoretic ordinals with the aid of Tauberian theorems for the Laplace transform. We intend to apply such formulas to extend the current knowledge on phase transitions for Gödel incompleteness results.