Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes

@inproceedings{Beyersdorff2009CharacterizingTE,
  title={Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes},
  author={Olaf Beyersdorff and Zenon Sadowski},
  booktitle={CSR},
  year={2009}
}
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L ? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP *** coNP, UP, BPP, disjoint NP-pairs etc.), these questions have been intensively studied during the last years, and a number of characterizations have been obtained. Here we provide new characterizations… 

Optimal Acceptors and Optimal Proof Systems

TLDR
This survey reviews the connections between the co-NP vs NP question and generalizations of acceptors and proof systems that lead or may lead to universal objects.

NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN

TLDR
It is proved that existence of a p-optimal proof system for $\mathsf{TAUT}$ and existence ofA complete problem for $\ mathsf{TFNP}$ are independent of each other in relativized worlds which was not known before.

On optimal probabilistic algorithms for Sat

TLDR
The paper addresses the question whether such optimal algorithms exist for NP-complete or coNP-complete problems, and the relationship between the existence of almost optimal algorithms for a language L and theexistence of “optimal” proof systems for L.

Listings and Logics

  • Yijia ChenJ. Flum
  • Mathematics
    2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
TLDR
It is shown that LFP_{inv], the ``order-invariant least fixed-point logic LFP,'' captures P if and only if there is a listing of the P subsets of the set TAUT of propositional tautologies, and the result is extended to listings of the L-subsets of TAUT and the logic DTC_{inv} (TC{inv}).

Different Approaches to Proof Systems

The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies This

Proof system representations of degrees of disjoint NP-pairs

  • Liyu Zhang
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 2011

On p-Optimal Proof Systems and Logics for PTIME

We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show that TAUT has no

On the computational complexity of finding hard tautologies

TLDR
This chapter discusses a polynomial time algorithm finding tautologies hard for a propositional proof system P such that P is not p‐bounded on the set of all formulas τk.

Do there exist complete sets for promise classes?

TLDR
This paper provides new characterizations for Q1 and Q2 that apply to almost all promise classes and languages L, thus creating a unifying framework for the study of these practically relevant questions.

Proof complexity

A universal statement of this form is a statement that a propositional formula cannot be satisfied by any truth assignment or, equivalently, that the negation of the formula is a tautology. The

References

SHOWING 1-10 OF 23 REFERENCES

The relative efficiency of propositional proof systems

TLDR
All standard Hilbert type systems and natural deduction systems are equivalent, up to application of a polynomial, as far as minimum proof length goes, and extended Frege systems are introduced, which allow introduction of abbreviations for formulas.

Optimal proof systems imply complete sets for promise classes

Feasibly constructive proofs and the propositional calculus (Preliminary Version)

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1975
TLDR
The Main Theorem (5.5) in this paper describes the power of extended resolution in a way that may provide a handle for showing that no proof system for the tautologies is “super” in the sense that there is a short proof for every tautology.

Optimal Proof Systems and Complete Languages

  • Zenon Sadowski
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2008
TLDR
It is proved that an optimal propositionalProof system exists if and only if there exists a propositional proof system in which every promise class with the test set in co-NP is representable.

Nondeterministic Instance Complexity and Proof Systems with Advice

TLDR
This paper investigates the following question: Given a language L, do there exist polynomially bounded proof systems with advice for L, and shows that the above question is tightly linked with the question whether L has small nondeterministic instance complexity.

Reductions between disjoint NP-pairs

Classes of representable disjoint NP-pairs

Disjoint NP-pairs

TLDR
It is shown under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, and an oracle relative to which complete pairs exist, but optimal proof systems do not exist is constructed, which provide additional evidence for the existence of P-inseparable disj joint NP-Pairs.

On an optimal propositional proof system and the structure of easy subsets of TAUT