# 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…

## 11 Citations

### Optimal Acceptors and Optimal Proof Systems

- Computer ScienceTAMC
- 2010

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

- MathematicsThe Journal of Symbolic Logic
- 2021

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

- Mathematics
- 2011

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

- Mathematics2011 IEEE 26th Annual Symposium on Logic in Computer Science
- 2011

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

- Computer ScienceTAMC
- 2010

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

- Mathematics, Computer ScienceInf. Process. Lett.
- 2011

### On p-Optimal Proof Systems and Logics for PTIME

- Computer Science, MathematicsICALP
- 2010

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

- Computer Science, MathematicsArXiv
- 2012

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?

- MathematicsMath. Log. Q.
- 2011

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

- PhilosophyMathematics and Computation
- 2019

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

### Nondeterministic functions and the existence of optimal proof systems

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 2009

### The relative efficiency of propositional proof systems

- Mathematics, Computer ScienceJournal of Symbolic Logic
- 1979

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

- Mathematics, Computer ScienceInf. Comput.
- 2003

### Feasibly constructive proofs and the propositional calculus (Preliminary Version)

- Mathematics, Computer ScienceSTOC
- 1975

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

- Mathematics, Computer ScienceElectron. Colloquium Comput. Complex.
- 2008

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

- Computer Science, MathematicsLATA
- 2008

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

- MathematicsProceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
- 2004

### Classes of representable disjoint NP-pairs

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 2007

### Disjoint NP-pairs

- Mathematics18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
- 2003

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

- Mathematics, EconomicsTheor. Comput. Sci.
- 2002