Every super-polynomial proof in purely implicational minimal logic has a polynomially sized proof in classical implicational propositional logic
Computational Complexity
2015-08-14 v3 Logic in Computer Science
Abstract
In this article we show how any formula A with a proof in minimal implicational logic that is super-polynomially sized has a polynomially-sized proof in classical implicational propositional logic . This fact provides an argument in favor that any classical propositional tautology has short proofs, i.e., NP=CoNP.
Keywords
Cite
@article{arxiv.1505.06506,
title = {Every super-polynomial proof in purely implicational minimal logic has a polynomially sized proof in classical implicational propositional logic},
author = {Edward Hermann Haeusler},
journal= {arXiv preprint arXiv:1505.06506},
year = {2015}
}
Comments
This paper has been withdrawn by the author due to a fatal error in the general form of the deduction used for proved the main proposition