Short Resolution refutations of Ref(φ) yield satisfying assignments for φ in polynomial time via a PV1-formalizable construction, and the Proof Analysis Problem is NP-complete for Extended Frege.
2020.102930
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
A geometric iteration method is developed for generalised perfect set forcing P(F), enabling its iteration with ≤κ supports along well-founded partial orders while preserving cardinals ≤κ⁺.
Satisfiability of propositional logic with nonemptiness atom NE in team semantics is NP-complete, validity coNP-complete, and model checking polynomial-time.
citing papers explorer
-
Iterating Generalised Perfect Set Forcing Along Well-Founded Orders
A geometric iteration method is developed for generalised perfect set forcing P(F), enabling its iteration with ≤κ supports along well-founded partial orders while preserving cardinals ≤κ⁺.