Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

REDUCTION OF HILBERT-TYPE PROOF SYSTEMS TO THE IF-THEN-ELSE EQUATIONAL LOGIC

  • Jeong, Joo-Hee (Department of Mathematics Education, Kyungpook National University)
  • 발행 : 2004.01.01

⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. Theoretical Computer Science v.159 A proper hierarchy of propositional sequent calculi N. Arai
  2. Annals of Pure and Applied Logic v.104 Relative efficiency of propositional proof systems: resolution vs. cut-free LK N. Arai
  3. Siam J. Computing v.12 Varieties of "if-then-else" S. Bloom;R. Tindell
  4. J. Symbolic Computation v.13 Discriminator varieties and symbolic computation S. Burris
  5. manuscript S. Burris
  6. J. of Symbolic Logic v.44 no.1 The relative efficiency of propositional proof systems S. Cook;R. Rechkow
  7. Linear reduction of first-order logic to if-then-else equation logic J. Jeong
  8. J. of Symbolic Logic v.54 no.3 Propositional proof systems, the consistency of first order theories and the complexity of computations J. Krajicek;P. Pudlak
  9. J. Symbolic Logic v.40 On the spectra, and negative solution of the decistion problem for identities having finite nontrivial model R. McKenzie
  10. Siam J. of Computing v.18 Equational bases for if-then-else logic A. Mekler;E. Nelson
  11. Lecture Notes in Computer Sci. STACS 98 v.1373 Optimal proof systems for propositional logic and complete sets J. Messner;J. Toran
  12. Theoretical Computer Science v.66 The complexity of Gentzen systems for propositional logic A. Urquhart