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.

Author Profiles

Richard Zach
University of Calgary

Analytics

Added to PP
2017-10-10

Downloads
404 (#54,565)

6 months
81 (#69,310)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?