
Proof compression and NP versus PSPACE: Addendum
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
read it

On proof theory in computer science
The subject logic in computer science should entail proof theoretic appl...
read it

Proof Compression and NP Versus PSPACE II: Addendum
In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic ...
read it

Critique of Barbosa's "P != NP Proof"
We review André Luiz Barbosa's paper "P != NP Proof," in which the class...
read it

On randomized counting versus randomised decision
We study the question of which counting problems admit f.p.r.a.s., under...
read it

Postulatebased proof of the P != NP hypothesis
The paper contains a proof for the P != NP hypothesis with the help of t...
read it

On ArroyoFigueroa's Proof that P≠NP
We critique Javier ArroyoFigueroa's paper titled “The existence of the ...
read it
Proof compression and NP versus PSPACE. Part 2
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): 5583 (2019)
READ FULL TEXT
Comments
There are no comments yet.