Can I read On Computationally Efficient Subsystems of Propositional Logic on EtoBox?

On Computationally Efficient Subsystems of Propositional Logic by Lev, Inga is a scholarly article available to read on EtoBox.

What is On Computationally Efficient Subsystems of Propositional Logic about?

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.

Author

Lev, Inga

Published

2020

Language

EN