Abstract
We prove that TAUT has a p-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 has no effective p-optimal proof system if NTIME for every time constructible and increasing function h. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Chen, Y., & Flum, J. (2010). On p-optimal proof systems and logics for PTIME. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6199 LNCS, pp. 321–332). https://doi.org/10.1007/978-3-642-14162-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free