Approximating Propositional Calculi by Finite-valued Logics

&
In Baaz Matthias & Zach Richard (eds.), 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. IEEE Press. pp. 257–263 (1994)
  Copy   BIBTEX

Abstract

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can be computed from the calculus.

Categories

Keywords

Reprint years

Links

PhilArchive

External links

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

Through your library

My notes

Similar books and articles

Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
Finite-valued reductions of infinite-valued logics.Aguzzoli Stefano & Gerla Brunella - 2002 - Archive for Mathematical Logic 41 (4):361-399.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Labeled calculi and finite-valued logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
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.
Compact propositional Gödel logics.Matthias Baaz & Richard Zach - 1998 - In Baaz Matthias (ed.), 28th IEEE International Symposium on Multiple-Valued Logic, 1998. Proceedings. IEEE Press. pp. 108-113.
Dual Systems of Sequents and Tableaux for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Bulletin of the EATCS 51:192-197.
Many-place sequent calculi for finitely-valued logics.Alexej P. Pynko - 2010 - Logica Universalis 4 (1):41-66.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
Lógicas multivalentes. Uma introdução matemática e computacional.Luis M. Augusto - 2016 - Dissertation, Universidade Aberta
On the Rosser–Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz.Mateusz M. Radzki - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):27-32.
Many-valued modal logics.Melvin C. Fitting - unknown
How to avoid deviance (in logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics.Arnon Avron, Jonathan Ben-Naim & Beata Konikowska - 2007 - Logica Universalis 1 (1):41-70.

Analytics

Added to PP
2017-10-10

Downloads
307 (#62,804)

6 months
67 (#63,103)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Zach
University of Calgary
Matthias Baaz
TU Wien

Citations of this work

No citations found.

Add more citations

References found in this work

A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.

Add more references