Skip to main content
SpringerLink
Log in

Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1397))

Abstract

We generalize finite-valued modal logics by introducing the concept of distribution modalities in analogy to distribution quantifiers. Sound and complete proof search procedures are provided using prefixed signed tableaux. Examples indicate that our generalized concept of modalities is indeed needed to formalize different types of statements in contexts of “graded truth” and inconsistent or incomplete databases.

Partly supported by COST-Action No. 15.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Matthias Baaz and Christian G. Fermüller. Resolution-based theorem proving for many-valued logics. Journal of Symbolic Computation, 19:353–391, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. Matthias Baaz and Christian G. Fermüller. Combining many-valued and intuitionistic tableaux. In Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX’96), volume 1071 of Lecture Notes in Artificial Intelligence, pages 65–79. Springer, 1996.

    Google Scholar 

  3. Matthias Baaz, Gernot Salzer, Christian G. Fermüller, and Richard Zach. MUlt-log 1.0: Towards an expert system for many-valued logics. In 13th Int. Conf. on Automated Deduction (CADE’96), volume 1104 of Lecture Notes in Artificial Intelligence, pages 226–230. Springer, 1996.

    Google Scholar 

  4. N. D. Belnap. A useful four-valued logic. In J.M. Dunn and G. Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 8–37. D. Reidel Publishing Co., Boston, 1977.

    Google Scholar 

  5. Walter A. Carnielli. Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic logic, 52(2):437–493, 1987.

    Article  MathSciNet  Google Scholar 

  6. Melvin C. Fitting. Proof Methods for Modal and Intuitionistic Logics. D. Reidel Publishing Co., Dordrecht, 1983.

    MATH  Google Scholar 

  7. Melvin C. Fitting. Many-valued modal logics. Fundamenta Informaticae, 15:235–254, 1992.

    MathSciNet  Google Scholar 

  8. Melvin C. Fitting. Many-valued modal logics II. Fundamenta Informaticae, 17:55–73, 1992.

    MATH  MathSciNet  Google Scholar 

  9. Melvin C. Fitting. Tableaus for many-valued modal logic. Studia Logica, 15:63–87, 1995.

    Article  MathSciNet  Google Scholar 

  10. K. Gödel. Zum intuitionistischen Aussagenkalkül. Anzeiger der Akademie der Wissenschaften in Wien, 69:65–66, 1932.

    Google Scholar 

  11. Siegfried Gottwald. Mehrwertige Logik. Akademie-Verlag, Berlin, 1989.

    MATH  Google Scholar 

  12. Reiner Hähnle. Towards an efficient tableau proof procedure for multiple-valued logics. In Computer Science Logic (CSL’90), volume 533 of Lecture Notes in Computer Science, pages 248–260. Springer, 1991.

    Google Scholar 

  13. Reiner Hähnle. Automated Deduction in Multiple-valued Logics. Clarendon Press, Oxford, 1993.

    MATH  Google Scholar 

  14. Reiner Hähnle. Commodious axiomatization of quantifiers in multiple-valued logic. In Proc. 26th International Symposium on Multiple-valued Logic, pages 118–123, Los Alamitos, 1996. IEEE Press.

    Google Scholar 

  15. Charles G. Morgan. Local and global operators and many-valued modal logics. Notre Dame Journal of Formal Logic, 20:401–411, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  16. Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30:130–137, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  17. Hans Jürgen Ohlbach. Translation methods for non-classical logics — an overview. Journal of the IGPL, 1(1):69–90, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. Hans Jürgen Ohlbach. Computer support for the development and investigation of logics. Technical Report MPI-I-94-228, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1994.

    Google Scholar 

  19. Pascal Ostermann. Many-valued modal propositional calculi. Zeitschrift für mathematische Logic und Grundlagen der Mathematik, 34:343–354, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  20. Pascal Ostermann. Many-valued modal logics: Uses and predicate calculus. Zeitschrift für mathematische Logic und Grundlagen der Mathematik, 36:367–376, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  21. Nicholas Rescher. Many-valued Logic. McGraw-Hill, New York, 1969.

    MATH  Google Scholar 

  22. Gernot Salzer. Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices. In 13th Int. Conf. on Automated Deduction (CADE’96), volume 1104 of Lecture Notes in Artificial Intelligence, pages 226–230. Springer, 1996.

    Google Scholar 

  23. Peter K. Schotch, Jorgen B. Jensen, Peter F. Larsen, and Edwin J. MacLellan. A note on three-valued modal logics. Notre Dame Journal of Formal Logic, 19:63–68, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  24. Krister Segerberg. Some modal logics based on a three-valued logic. Theoria, 33:53–71, 1967.

    Article  MATH  MathSciNet  Google Scholar 

  25. S. K. Thomason. Possible worlds and many truth values. Studia Logica, 37:195–204, 1978.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Computersprachen, Technische Universität, Karlsplatz 13/E185.2, A-1040, Wien, Austria

    Christian G. Fermüller & Herbert Langsteiner

Authors
  1. Christian G. Fermüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Langsteiner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy, Tilburg University, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands

    Harrie de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fermüller, C.G., Langsteiner, H. (1998). Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities. In: de Swart, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science(), vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69778-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-69778-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64406-4

  • Online ISBN: 978-3-540-69778-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation