Skip to main content
SpringerLink
Log in

Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics

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

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

Abstract

In this paper we investigate the tableau systems corresponding to hypersequent calculi. We call these systems hypertableau calculi. We define hypertableau calculi for some propositional intermediate logics. We then introduce path-hypertableau calculi which are simply defined by imposing additional structure on hypertableaux. Using path-hypertableaux we define analytic calculi for the intermediate logics Bd k , with k ≥1, which are semantically characterized by Kripke models of depth ≤k. These calculi are obtained by adding one more structural rule to the path-hypertableau calculus for Intuitionistic Logic.

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 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 tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL 7(4), 447–480 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Avron, A.: A constructive analysis of RM. J. Symbolic Logic 52, 939–951 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Avron, A.: The method of hypersequents in the proof theory of propositional nonclassical logics. In: Logic: from Foundations to Applications, European Logic Colloquium, pp. 1–32. Oxford University Press, Oxford (1996)

    Google Scholar 

  5. Baumgartner, P., Furbach, U., Niemelae, I.: Hyper Tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS (LNAI), vol. 1126, pp. 1–17. Springer, Heidelberg (1996)

    Google Scholar 

  6. Baaz, M., Fermüller, C.G.: Analytic calculi for projective logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 36–51. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1997)

    MATH  Google Scholar 

  8. Ciabattoni, A., Ferrari, M.: Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation (to appear)

    Google Scholar 

  9. Ciabattoni, A., Gabbay, D.M., Olivetti, N.: Cut-free proof systems for logics of weak excluded middle. Soft Computing 2(4), 147–156 (1998)

    Google Scholar 

  10. Dyckhoff, R.: A deterministic terminating sequent calculus for Gödel-Dummett logic. Logic J. of the IGPL 7, 319–326 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fitting, M.C.: Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht (1983)

    MATH  Google Scholar 

  12. Gabbay, D.M.: Semantical Investigations in Heyting’s Intuitionistic Logic. Reidel, Dordrecht (1983)

    Google Scholar 

  13. Gabbay, D.M., Olivetti, N.: Goal-Directed Proof Theory. Kluwer, Dordrecht (to appear)

    Google Scholar 

  14. Hähnle, R.: Automated Deduction in Multiple-valued Logics. Oxford University Press, Oxford (1993)

    MATH  Google Scholar 

  15. Maksimova, L.: Craig’s theorem in superintuitionistic logics and amalgamable varieties of pseudo-boolean algebras. Algebra and Logic 16, 427–455 (1977)

    Article  MathSciNet  Google Scholar 

  16. Miglioli, P., Moscato, U., Ornaghi, M.: Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic. Logic J. of the IGPL 5(1), 145–167 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pottinger, G.: Uniform, cut-free formulation of T,S4 and S5 (abstract). J. Symbolic Logic 48, 900 (1983)

    Google Scholar 

  18. Jankov, V.: The calculus of the weak ”law of excluded middle”. Mathematics of the USSR 8, 648–658 (1968)

    Google Scholar 

  19. Rousseau, G.: Sequent in many valued logic, I and II. Fund. Math. 60 and 67, 23–33 (1967), 125–131 (1970)

    Google Scholar 

  20. Smullyan, R.M.: First-Order Logic. Springer, Berlin (1968)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Agata Ciabattoni & Mauro Ferrari

Authors
  1. Agata Ciabattoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mauro Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St Andrews, Scotland

    Roy Dyckhoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciabattoni, A., Ferrari, M. (2000). Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics. 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_15

Download citation

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

  • 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

Search

Navigation