On Computationally Efficient Subsystems of Propositional Logic
Logic
2020-12-01 v1
Abstract
In this paper, we show that the derivability problem for the primal propositional logic remains solvable in polynomial time upon adding a certain form of the principle of equivalent form substitution; and that, upon adding another form of this principle, it becomes co-NP-hard.
Cite
@article{arxiv.2011.14415,
title = {On Computationally Efficient Subsystems of Propositional Logic},
author = {Inga Lev},
journal= {arXiv preprint arXiv:2011.14415},
year = {2020}
}
Comments
16 pages