On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems