Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ECCC
2010

favoriteEmaildiscussreport

82views more ECCC 2010»

On optimal proof systems and logics for PTIME

13 years 5 months ago

On optimal proof systems and logics for PTIME

Download basics.sjtu.edu.cn

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(hO(1) ) DTIME(hO(log h) ) for every time constructible and increasing function h.

Yijia Chen, Jörg Flum

Real-time Traffic

ECCC 2010 | Effective P-optimal Proof | Fixed-point Logic | P-optimal Proof |

claim paper

Related Content

» On pOptimal Proof Systems and Logics for PTIME

» On the Computational Complexity of CutElimination in Linear Logic

» On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT

» Automatic Parallelization and Optimization of Programs by Proof Rewriting

» Optimal Proof Systems for Propositional Logic and Complete Sets

» Simple relational correctness proofs for static analyses and program transformations

» Optimal Tableaux for Conditional Logics with Cautious Monotonicity

» A machinechecked soundness proof for an efficient verification condition generator

» SourceTracking Unification

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ECCC
Authors	Yijia Chen, Jörg Flum

Comments (0)