Skip to main content

Labelled Deduction over Algebras of Truth-Values*

  • Conference paper
  • First Online:
Frontiers of Combining Systems (FroCoS 2002)

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

Included in the following conference series:

Abstract

We introduce a framework for presenting non-classical logics in a modular and uniform way as labelled natural deduction systems. The use of algebras of truth-values as the labelling algebras of our systems allows us to give generalized systems for multiple-valued logics. More specifically, our framework generalizes previous work where labels represent worlds in the underlying Kripke structure: since we can take multiple-valued logics as meaning not only finitely or infinitely many-valued logics but also power-set logics, our framework allows us to present also logics such as modal, intuitionistic and relevance logics, thus providing a first step towards fibring these logics with many-valued ones.

Work partially supported by Fundação para a Ciência e a Tecnologia, Portugal.

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. M. Baaz, C. G. Fermüller, G. Salzer, and R. Zach. Labeled calculi and finite-valued logics. Studia Logica, 61(1):7–33, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Basin, M. D'Agostino, D. M. Gabbay, S. Matthews, and L. Viganò, eds.. Labelled Deduction. KluwerAcademic Publishers, 2000.

    Google Scholar 

  3. D. Basin, S. Matthews, and L. Viganò. Natural deduction for non-classical logics. Studia Logica, 60(1):119–160, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Blackburn and M. de Rijke. Why combine logics? Studia Logica, 59:5–27, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.

    Google Scholar 

  6. L. Bolc and P. Borowik. Many-Valued Logics I. Springer-Verlag, 1992.

    Google Scholar 

  7. W. Carnielli. Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic Logic, 52(2):473–493, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. D'Agostino and D. M. Gabbay. A Generalization of Analytic Deduction via Labelled Deductive Systems I: Basic Substructural Logics. Journal of Automated Reasoning, 13(2):243–281, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. D'Agostino, D. M. Gabbay, R. Hähnle, and J. Posegga, eds.. Handbook of Tableau Methods. KluwerAcademic Publishers, 1999.

    Google Scholar 

  10. J. M. Dunn. Relevance logic and entailment. In D. M. Gabbay and F. Guenthner, eds., Handbook of Philosophical Logic III, pp. 117–224. D. Reidel Publ. Co, 1986.

    Google Scholar 

  11. D. M. Gabbay. Labelled Deductive Systems, volume 1. Clarendon Press, 1996.

    Google Scholar 

  12. D. M. Gabbay. Fibring Logics. Oxford University Press, 1999.

    Google Scholar 

  13. S. Gottwald. A Treatise on Many-Valued Logics. Research Studies Press, 2001.

    Google Scholar 

  14. R. Hähnle. Tableaux forman y-valued logics. In D'Agostino et al. [9], pp. 529–580.

    Google Scholar 

  15. J. Rasga, A. Sernadas, C. Sernadas, and L. Viganò. Fibring deduction systems labelled with truth-values. Technical report, Section of Computer Science, Department of Mathematics, Instituto Superior Técnico, Lisboa, Portugal, to appear.

    Google Scholar 

  16. J. Rasga, A. Sernadas, C. Sernadas, and L. Viganò. Fibring labelled deduction systems. Journal of Logic and Computation, to appear.

    Google Scholar 

  17. G. Restall. Relevant and substructural logics. In D. M. Gabbay and J. Woods, eds., Handbook of the History and Philosophy of Logic. To appear.

    Google Scholar 

  18. A. Sernadas, C. Sernadas, and C. Caleiro. Fibring of logics as a categorial construction. Journal of Logic and Computation, 9(2):149–179, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  19. A. Sernadas, C. Sernadas, C. Caleiro, and T. Mossakowski. Categorial fibring of logics with terms and binding operators. In M. de Rijke and D. M. Gabbay, eds., Frontiers of Combining Systems 2, pp. 295–316. Research Studies Press, 2000.

    Google Scholar 

  20. A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.

    Google Scholar 

  21. L. Viganò. Labelled Non-Classical Logics. KluwerAcademic Publishers, 2000.

    Google Scholar 

  22. A. Zanardo, A. Sernadas, and C. Sernadas. Fibring: Completeness preservation. Journal of Symbolic Logic, 66(1):414–439, 2001.

    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

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rasga, J., Sernadas, A., Sernadas, C., Viganò, L. (2002). Labelled Deduction over Algebras of Truth-Values* . In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45988-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43381-1

  • Online ISBN: 978-3-540-45988-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics