Advertisement

A syntactic connection between proof procedures and refutation procedures

  • W. Bibel
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Abstract

It is constructively shown that there is a common improvement of both proof procedures and refutation procedures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [STP]
    Bibel, W.: An approach to a systematic theorem proving procedure in first-order logic. Computing 12, 43–55 (1974).Google Scholar
  2. [EVB]
    Bibel, W.: Effizienzvergleiche von Beweisprozeduren. GI '74, Lect. Notes Comp. Sci. 26, 153–160 (1975).Google Scholar
  3. [PSG]
    Bibel, W. and Schreiber, J.: Proof search in a Gentzen-like system of first-order logic. Proc. Int. Comp. Symp. (ICS'75), North-Holland, 205–212 (1975).Google Scholar
  4. [MB]
    Bibel, W.: Maschinelles Beweisen. Jahrbuch Überblicke Mathematik, B. Fuchssteiner, U. Kulisch, D. Langwitz, R. Liedl (eds.), BI Wissenschaftsverlag, 115–142 (1976).Google Scholar
  5. [UTP]
    Bledsoe, W.W. and Tyson, M.: The U.T. Interactive Prover. Memo ATP-17, Math. Dept., Univ. Texas, Austin (1975).Google Scholar
  6. [LTP]
    Chang, C.-L. and Lee, R.C.-T.: Symbolic Logic and mechanical theorem proving. Academic Press (1973).Google Scholar
  7. [RAH]
    Joyner, W.H., Jr.: A resolution analogue to the Herbrand theorem. Presented at the conference on Automatic Theorem Proving, Oberwolfach (1976).Google Scholar
  8. [ITP]
    Overbeek, R.: An approach to the implementation of theorem proving systems. Presented at the conference on Automatic Theorem Proving, Oberwolfach (1976).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • W. Bibel

There are no affiliations available

Personalised recommendations