# Computer Science

## r/computerscience

*pinned by moderators*

Using PSPACE-completeness of quantified boolean logic Valerii Sopin claimed to have obtained that **PH = PSPACE**, see https://arxiv.org/abs/1411.0628

*True quantified Boolean formula is indeed a generalisation of the Boolean Satisfiability Problem, where determining of interpretation that satisfies a given Boolean formula is replaced by existence of Boolean functions that makes a given QBF to be tautology. Such functions are called the Skolem functions.*

*The essential idea of the proof is to skolemize, and then use additional formulas from the second level of the polynomial hierarchy inside the skolemized prefix to enforce that the skolem variables indeed depend only on the universally quantified variables they are supposed to. However, some dependence is lost when the quantification is reversed. It is called "XOR issue" because the functional dependence can be expressed by means of an XOR formula. Thus, it is needed to locate these XORs, but there is no need to locate all chains with XORs: any chain includes a XOR of only two variables. The last can be done locally in each iteration (keep in mind the algebraic normal form (ANF)), when all arguments are specified.*

**Relativization** is defeated due to the well-known fact: PH = PSPACE iff second-order logic over finite structures gains no additional power from the addition of a transitive closure operator. Boolean algebra is finite. The exchange is possible due to finite possibilities for arguments. So, the theorems with oracles are not applicable since a random oracle is an arbitrary set. And that’s why Polynomial Hierarchy is infinite relative to a random oracle with probability 1.

## About Community

Members

Online

## Filter by flair

## r/computerscience Rules

## Related subreddits

2,120,521 members

66,071 members

24,154 members

988 members

4,663,200 members

80,266 members

3,446,681 members

925,892 members

144,767 members

173,979 members

## Related subreddits

129,933 members

56,722 members

215,642 members

777,543 members

508,990 members

13,012,808 members

1,809,585 members