Calculi for Many-Valued Logics

Logica Universalis 15 (2):193-226 (2021)
  Copy   BIBTEX

Abstract

We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Proof Theory of Paraconsistent Quantum Logic.Norihiro Kamide - 2018 - Journal of Philosophical Logic 47 (2):301-324.
Rough Sets and 3-Valued Logics.A. Avron & B. Konikowska - 2008 - Studia Logica 90 (1):69-92.
Finite-valued reductions of infinite-valued logics.Aguzzoli Stefano & Gerla Brunella - 2002 - Archive for Mathematical Logic 41 (4):361-399.
Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.

Analytics

Added to PP
2021-05-15

Downloads
35 (#456,481)

6 months
10 (#268,574)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nissim Francez
Technion, Israel Institute of Technology

References found in this work

Harmony in Multiple-Conclusion Natural-Deduction.Nissim Francez - 2014 - Logica Universalis 8 (2):215-259.
Nonstandard connectives of intuitionistic propositional logic.Michael Kaminski - 1988 - Notre Dame Journal of Formal Logic 29 (3):309-331.
Many-valued logics of extended Gentzen style II.Moto-O. Takahashi - 1970 - Journal of Symbolic Logic 35 (4):493-528.

Add more references