A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
On Proof Complexity of Some Type of Tautologies
2021
Mathematical Problems of Computer Science
Preserved Fulltext
In this paper, we investigate the proof complexities of a special type of tautologies, which are described as tautologies consisting of implications and literals. In particular, we prove that the proof of this kind of tautologies can be polynomially reduced to the proof of tautologies consisting of formulas that are described by sign-alternating trees.
doi:10.51408/1963-0080
fatcat:pq3lnmhnonhq5abgjp4kmrjzia