2000 character limit reached
Proof compression and NP versus PSPACE. Part 2 (1907.03858v2)
Published 8 Jul 2019 in cs.LO
Abstract: We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)