POLYNOMIAL LENGTH PROOFS FOR SOME CLASS OF TSEITIN FORMULAS

Ashot Abajian

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

In this paper the notion of quasi-hard determinative formulas is introduced and the proof complexities of such formulas are investigated. For some class of quasi-hard determinative formulas the same order lower and upper bounds for the length of proofs are obtained in several proof systems, basing on disjunctive normal forms (conjunctive normal forms).

Author(s)

Table of Contents

POLYNOMIAL LENGTH PROOFS FOR SOME CLASS OF TSEITIN FORMULAS

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

POLYNOMIAL LENGTH PROOFS FOR SOME CLASS OF TSEITIN FORMULAS

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter