Advertisement

An application of automated equational reasoning to many-valued logic

  • Siva Anantharaman
  • Maria Paola Bonacina
Chapter 3 Extension Of Knuth-Bendix Completion
Part of the Lecture Notes in Computer Science book series (LNCS, volume 516)

Abstract

In this paper we present a new set of axioms of an algebaric nature, for the many-valued logic of Lukasiewicz. These axioms are similar to those given by J.Hsiang for the Boolean Algebra. The equivalence of our set of axioms with those given by Lukasiewicz himself is proved mechanically, by resorting to the Automatic UKB-based Equational Theorem Prover SBR3. These new axioms may be helpful for further equational reasoning in such logics, or for interpreting the ‘equality symbol’ of linear logic. This paper is organized as follows. Section 1 presents briefly the many-valued logic. Section 2 indicates the proof-steps leading to our new set of axioms. Section 3 presents the equational prover SBR3.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AA-90]
    S.Anantharaman, N. Andrianarivelo, Heuristic Criteria in Refutational Theorem Proving, Research-Report, LRI-Orsay(Fr.), no. 541, 1990, Extended-Abstract in Proc. DISCO'90, LNCS. no. 429Google Scholar
  2. [AA-91]
    S.Anantharaman, N. Andrianarivelo, A Complete Semi-Decision Procedure for Horn Theories, Research Report, LIFO-LRI(Fr.), (to appear in Feb.-March 1991)Google Scholar
  3. [AH-90]
    S.Anantharaman, J.Hsiang, Automated Proofs of the Moufang Identities in Alternative Rings, Vol. 1, J. Automated Reasoning, 1990Google Scholar
  4. [AHM-89]
    S. Anantharaman, J. Hsiang, J. Mzali, SbReve2: A term rewriting laboratory with (AC-)Unfailing Completion, RTA, Springer-Verlag LNCS Vol. 355, pp533–537, 1989Google Scholar
  5. [AM-88]
    S.Anantharaman, J.Mzali, Unfailing Completion Modulo a set of Equations, Research Report, no. 470, LRI-Orsay (Fr.), 1989Google Scholar
  6. [BDP-87]
    L.Bachmair, N.Dershowitz, D.Plaisted, Completion without failure, Proc. Coll. on Resolution of Equations in Algebraic Structures, Lakeway, Texas, 1987Google Scholar
  7. [Der-90]
    N. Dershowitz, A Maximal-Literal Unit Strategy for Horn Clauses, Proc. of the 2nd CTRS, Montreal, 1990Google Scholar
  8. [FRT-84]
    J.M. Font, A.J. Rodriguez, A. Torrens, Wajsberg algebras, Stochastica, Vol. 8, No. 1, pp5–31, 1984Google Scholar
  9. [HR-87]
    J. Hsiang, M. Rusinowitch, On word problems in equational theories, 14th ICALP, Springer-Verlag LNCS Vol. 267, pp54–71, 1987Google Scholar
  10. [HRS-87]
    J. Hsiang, M. Rusinowitch, K. Sakai, Complete set of inference rules for the cancellation laws, IJCAI 87, Milan, Italy, 1987Google Scholar
  11. [Le-83]
    P. Lescanne, Computer Experiments with the REVE term rewriting system generator, 10th POPL, pp99–108, 1983Google Scholar
  12. [Mu]
    D.Mundici, Personal communication.Google Scholar
  13. [TL-56]
    A. Tarski, J. Lukasiewicz, Investigations into the sentential calculus, Chapter 4th in A.Tarski, Logic, Semantics, Meta-mathematics, pp38–56, Clarendon Press, Oxford, 19Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Siva Anantharaman
    • 1
  • Maria Paola Bonacina
    • 2
  1. 1.Lifo, Dépt. Math-Info.Université d'OrléansOrleans Cedex 02Fr.
  2. 2.Department of Computer ScienceSuny at Stony BrookStony BrookUSA

Personalised recommendations