Reduction of Hilbert-type proof systems to the if-then-else equational logic
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  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.
AMS Mathematics Subject Classification03B22 03F99
Key words and phrasesProof systems reduction if-then-else equational logic
Unable to display preview. Download preview PDF.
- 5.S. Burris, manuscript, 1993Google Scholar
- 7.J. Jeong,Linear reduction of first-order logic to if-then-else equation logic, in preparationGoogle Scholar
- 11.J. Messner and J. Torán,Optimal proof systems for propositional logic and complete sets, Lecture Notes in Computer Sci.1373, Springer, Berlin, 1998, STACS 98 (Paris), 477–487Google Scholar