NP-completeness of BCI - another view

Speaker(s)

Aleksy Schubert

Affiliation

MIMUW

Date

Oct. 29, 2021, 12:15 p.m.

Room

room 5820

Seminar

Seminar Semantics, Logic, Verification and its Applications

---

Another proof of NP-hardness of provability in BCI is presented. As a more natural source of the reduction, the one-in-three 3SAT problem is assumed.

---