Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Arai,A proper hierarchy of propositional sequent calculi, Theoretical Computer Science159 (1996), 343–354
N. Arai,Relative efficiency of propositional proof systems: resolution vs. cut-free LK, Annals of Pure and Applied Logic104 (2000), 3–16
S. Bloom and R. Tindell,Varieties of “if-then-else”, Siam J. Computing12 (1983), 677–707
S. Burris,Discriminator varieties and symbolic computation, J. Symbolic Computation13 (1992), 175–207
S. Burris, manuscript, 1993
S. Cook and R. Rechkow,The relative efficiency of propositional proof systems, J. of Symbolic Logic44 (1979), no. 1, 36–50
J. Jeong,Linear reduction of first-order logic to if-then-else equation logic, in preparation
J. Krajicek and P. Pudlak,Propositional proof systems, the consistency of first order theories and the complexity of computations, J. of Symbolic Logic54 (1989), no. 3, 1063–1079.
R. McKenzie,On the spectra, and negative solution of the decision problem for identities having finite nontrivial model, J. Symbolic Logic40 (1975), 186–196
A. Mekler and E. Nelson,Equational Bases for if-then-else logic, Siam J. of Computing,18 (1989), 465–485
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–487
A. Urquhart,The complexity of Gentzen systems for propositional logic, Theoretical Computer Science66 (1989), 87–97
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by grant No. R01-2000-00287 from the Basic Research Program of the Korea Science & Engineering Foundation.
Joohee Jeong received his BS from Seoul National University and Ph.D. at the University of California at Berkeley under the direction of Prof. R. McKenzie. His research interests focus on logic, universal algebra and their application to programming language semantics.
Rights and permissions
About this article
Cite this article
Jeong, J. Reduction of Hilbert-type proof systems to the if-then-else equational logic. JAMC 14, 69–80 (2004). https://doi.org/10.1007/BF02936099
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02936099