Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Proof compression and NP versus PSPACE. Part 2
Lev Gordeev
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)
cs.LO2019
Predicative proof theory of PDL and basic applications
Lev Gordeev
Propositional dynamic logic (PDL) is presented in Schütte-style mode as one-sided semiformal tree-like sequent calculus Seq with standard cut rule and the omega-ru…