Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
