A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories

Kevin J. Compton, C. Ward Henson. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Annals of Pure and Applied Logic, 48(1):1-79, 1990.

Authors

Kevin J. Compton

This author has not been identified. Look up 'Kevin J. Compton' in Google

C. Ward Henson

This author has not been identified. Look up 'C. Ward Henson' in Google