Advertisement

Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic

  • Matthias Baaz
  • Richard Zach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1862)

Abstract

Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and complete, and allows cut-elimination. A question by Takano regarding the eliminability of the Takeuti-Titani density rule is answered affirmatively.

2000 Mathematics Subject Classification

03B50 03B55 03F05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Avellone, M. Ferrari, P. Miglioli, and U. Moscato. A tableau calculus for Dummett predicate logic. In W. A. Carnielli and I. M. L. D’Ottaviano, editors, Advances in Contemporary Logic and Computer Science, Contemporary Mathematics 235, 135–151. American Mathematical Society, Providence, 1999.Google Scholar
  2. [2]
    A. Avron. Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artificial Intelligence, 4:225–248, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    M. Baaz and H. Veith. An axiomatization of quantified propositional Gödel logic using the Takeuti-Titani rule. In S. Buss, P. Hájek, and P. Pudlák, editors, Logic Colloquium’ 98. Proceedings, LNL 13, 74–87. ASL, 2000.Google Scholar
  4. [4]
    G. Corsi. A cut-free calculus for Dummett’s LC quantified. Z. Math. Logik Grundlag. Math., 35:289–301, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    G. Corsi. Completeness theorem for Dummett’s LC quantified and some of its extensions. Studia Logica, 51:317–335, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    M. Dummett. A propositional calculus with denumerable matrix. J. Symbolic Logic, 24:97–106, 1959.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    D. M. Gabbay. Decidability of some intuitionistic predicate theories. J. Symbolic Logic, 37:579–587, 1972.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    K. Gödel. Zum intuitionistischen Aussagenkalkül. Anz. Akad. Wiss. Wien, 69:65–66, 1932.Google Scholar
  9. [9]
    P. Hájek. Metamathematics of Fuzzy Logic. Kluwer, Dordrecht, 1998.zbMATHGoogle Scholar
  10. [10]
    A. Horn. Logic with truth values in a linearly ordered Heyting algebra. J. Symbolic Logic, 34:395–408, 1969.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    M. Takano. Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba J. Math, 11:101–105, 1987.zbMATHMathSciNetGoogle Scholar
  12. [12]
    G. Takeuti. Proof Theory. North-Holland, Amsterdam, 2nd ed., 1987.zbMATHGoogle Scholar
  13. [13]
    G. Takeuti and S. Titani. Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symbolic Logic, 49:851–866, 1984.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Matthias Baaz
    • 1
  • Richard Zach
    • 2
  1. 1.Institut für Algebra und Computermathematik E118.2Technische Universität WienViennaAustria
  2. 2.Institut für Computersprachen E185.2Technische Universität WienViennaAustria

Personalised recommendations