Skip to main content

A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000)

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

Abstract

We present a terminating contraction-free calculus GLC * for the propositional fragment of Gödel-Dummett Logic LC. GLC * uses hypersequents, and unlike other Gentzen-type calculi for LC, all its rules have at most two premises. These rules are all invertible. Hence it can be used as a basis for a deterministic tableau system for LC. This tableau system is presented in the last section.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Avellone, A., Ferrari, M., Miglioli, P.: Duplication-free Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic J. IGPL 7, 447–480 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Avron, A.: Using Hypersequents in Proof Systems for Non-classical Logics. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baaz, M., Fermüller, G.C.: Analytic Calculi for Projective Logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 36–50. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Dunn, J.M., Meyer, R.K.: Algebraic Completeness Results for Dummett’s LC and its extensions. Z. math. Logik und Grundlagen der Mathematik 17, 225–230 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dummett, M.: A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic 24, 96–107 (1959)

    MathSciNet  Google Scholar 

  6. Dyckhoff, R.: A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic. Logic J. IGPL 7, 319–326 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gödel, K.: Zum intuitionistischen Aussagenkalkül, Ergeb. Math. Koll. 4, 40 (1933)

    Google Scholar 

  8. Hajek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)

    MATH  Google Scholar 

  9. Sonobe, O.: A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College 7, 7–14 (1975)

    MathSciNet  Google Scholar 

  10. Visser, A.: On the Completeness Principle: A study of provability in Heyting’s arithmetic. Annals of Mathematical Logic 22, 263–295 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avron, A. (2000). A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_11

Download citation

  • DOI: https://doi.org/10.1007/10722086_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

  • Online ISBN: 978-3-540-45008-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics