Abstract
We introduce two algebraic propositional proof systems F - NS and F - PC . The main difference of our systems from (customary) Nullstellensatz and polynomial calculus is that the polynomials are represented as arbitrary formulas (rather than sums of monomials). Short proofs of Tseitin's tautologies in the constant-depth version of F - NS provide an exponential separation between this system and Polynomial Calculus. We prove that F - NS (and hence F - PC ) polynomially simulates Frege systems, and that the constant-depth version of F - PC over finite field polynomially simulates constant-depth Frege systems with modular counting. We also present a short constant-depth F - PC (in fact, F - NS ) proof of the propositional pigeon-hole principle. Finally, we introduce several extensions of our systems and pose numerous open questions.
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 callDisclaimer: 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.
