- #1
Dragonfall
- 1,030
- 4
Every language in co-NP can be reduced in polynomial-time to an instance of [itex]\forall x P(x)[/itex] for some Boolean formula with a single bound variable and no free variables, right?