Skip to main content
Log in

On Gentzen Relations Associated with Finite-valued Logics Preserving Degrees of Truth

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

When considering m-sequents, it is always possible to obtain an m-sequent calculus VL for every m-valued logic (defined from an arbitrary finite algebra L of cardinality m) following for instance the works of the Vienna Group for Multiple-valued Logics. The Gentzen relations associated with the calculi VL are always finitely equivalential but might not be algebraizable. In this paper we associate an algebraizable 2-Gentzen relation with every sequent calculus VL in a uniform way, provided the original algebra L has a reduct that is a distributive lattice or a pseudocomplemented distributive lattice. We also show that the sentential logic naturally associated with the provable sequents of this algebraizable Gentzen relation is the logic that preserves degrees of truth with respect to the original algebra (in contrast with the more common logic that merely preserves truth). Finally, for some particular logics we obtain 2-sequent calculi that axiomatize the algebraizable Gentzen relations obtained so far.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Avron A.: Gentzen-type systems, resolution and tableaux. Journal of Automated Reasoning 10, 265–281 (1993)

    Article  Google Scholar 

  2. Baaz M., Fermueller C. G., Zach R.: Elimination of cuts in first-order finite-valued logics. Journal of Information Processing and Cybernetics EIK 29, 333–355 (1994)

    Google Scholar 

  3. Baaz, Matthias, Christian G. Fermüller, Gernot Salzer, and Richard Zach, Multlog 1.0: Towards an expert system for many-valued logics, in Michael A. McRobbie, and John K. Slaney, (eds.), CADE, vol. 1104 of Lecture Notes in Computer Science, Springer, 1996, pp. 226–230.

  4. Balbes, R., and P. Dwinger, Distributive lattices, University of Missouri Press, Columbia (Missouri), 1974.

  5. Bou F., Esteva F., Font J. M., Gil A., Godo L., Torrens A., Verdú V.: Logics preserving degrees of truth from varieties of residuated lattices. Journal of Logic and Computation 19, 1031–1069 (2009)

    Article  Google Scholar 

  6. Caleiro, Carlos, and Joäo Marcos, Classic-like analytic tableaux for finite-valued logics, in H. Ono, M. Kanazawa, and R. J. G. B. de Queiroz, (eds.), WoLLIC, vol. 5514 of Lecture Notes in Computer Science, Springer, 2009, pp. 268–280.

  7. Font J. M., A. Gil, Torrens A., Verdú V.: On the infinite-valued Łukasiewicz logic that preserves degrees of truth. Archive for Mathematical Logic 45, 839–868 (2006)

    Article  Google Scholar 

  8. Gil, A. J., On Hilbertizable Gentzen systems associated with finite valued logics, 2010. Manuscript. Results presented in UNILOG-2010, Lisbon.

  9. Gil A. J., Rebagliato J.: Protoalgebraic Gentzen systems and the cut rule. Studia Logica (Special issue on Abstract Algebraic Logic, Part I) 65, 53–89 (2000)

    Google Scholar 

  10. Gil A.J., Rebagliato J.: Finitely equivalential Gentzen systems associated with arbitrary finite algebras. Reports on Mathematical Logic (Special issue in memory of Willem Blok) 41, 9–30 (2006)

    Google Scholar 

  11. Gil A.J., Rebagliato J., Verdú V.: A strong completeness theorem for the Gentzen systems associated with finite algebras. Journal of Applied Non-Classical Logics 9, 9–36 (1999)

    Article  Google Scholar 

  12. Gil, A. J., and G. Salzer, MUltseq: a generic prover for sequents and equations, in Collegium Logicum: Annals of the Kurt-Gödel-Society, vol. 4, Kurt-Gödel-Society, Vienna, Austria, 2001, pp. 229–233.

  13. Gil A.J., Torrens A., Verdú V.: On Gentzen systems associated with the finite linear MV-algebras. Journal of Logic and Computation 7, 473–500 (1997)

    Article  Google Scholar 

  14. Gil, A. J., and G. Salzer, http://www.logic.at/multseq, 2002. Home page of MUltseq [online] (31 Oct. 2011).

  15. Hähnle Reiner: Commodious axiomatization of quantifiers in multiple-valued logic. Studia Logica 61(1), 101–121 (1998)

    Article  Google Scholar 

  16. Hähnle, Reiner, Tableaux for many-valued logics, in M. D’Agostino, D. Gabbay, R. Hähnle, and J. Posegga, (eds.), Handbook of tableau methods, vol. 114 of Studies in Fuzziness and Soft Computing, Springer, Heidelberg, 1999, pp. 529–580.

  17. Marcos, João, Automatic generation of proof tactics for finite-valued logics, in I. Mackie, and A. Martins Moreira, (eds.), RULE, vol. 21 of EPTCS, 2009, pp. 91–98.

  18. Raftery J.G.: Correspondences between Gentzen and Hilbert systems. J. Symbolic Logic 71(3), 903–957 (2006)

    Article  Google Scholar 

  19. Rasiowa, H., An algebraic approach to non-classical logics, vol. 78 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1974.

  20. Rebagliato, J., and V. Verdú, Algebraizable Gentzen systems and the deduction theorem for Gentzen systems, Mathematics Preprint Series 175, University of Barcelona, 1995.

  21. Rousseau G.: Sequents in many-valued logic I. Fundamenta Mathematicae 60, 23–33 (1967)

    Google Scholar 

  22. Vienna Group for Multiple-valued Logics, http://www.logic.at/multlog. Home page of MUltlog [online] (31 Oct. 2011).

  23. Zach, R., Proof theory of finite-valued logics, Diplomarbeit, Technische Universität Wien, Vienna, Austria, 1993. Available as Technical Report E185.2-Z.1-93.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Angel J. Gil.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gil, A.J. On Gentzen Relations Associated with Finite-valued Logics Preserving Degrees of Truth. Stud Logica 101, 749–781 (2013). https://doi.org/10.1007/s11225-013-9497-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-013-9497-0

Keywords

Navigation