Y Chen, J Flum - International Colloquium on Automata, Languages …, 2010 - Springer
We prove that TAUT has ap-optimal proof system if and only if a logic related to least fixed-
point logic captures polynomial time on all finite structures. Furthermore, we show that TAUT …