The following pages link to (Q4381398):
Displayed 6 items.
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Reduction of Hilbert-type proof systems to the if-then-else equational logic (Q1428985) (← links)
- On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)