Equational bases for if-then-else
SIAM Journal on Computing
The complexity of Gentzen systems for propositional logic
Theoretical Computer Science
Discriminator varieties and symbolic computation
Journal of Symbolic Computation
A proper hierarchy of propositional sequent calculi
Theoretical Computer Science
Optimal Proof Systems for Propositional Logic and Complete Sets
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
We present a construction of the linear reduction of Hilbert type proof systems for propositional logic to if-then-else equational logic. This construction is an improvement over the same result found in [4] in the sense that the technique used in the construction can be extended to the linear reduction of first-order logic to if-then-else equational logic.