Effective Finite-Valued Approximations of General Propositional Logics (original) (raw)

Lecture Notes in Computer Science, 2008

Abstract

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have ���nice��� representations, eg, are given by a calculus. Even decidable propositional logics can be computationally complex (eg, already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple���at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional ...

Richard Zach hasn't uploaded this paper.

Let Richard know you want this paper to be uploaded.

Ask for this paper to be uploaded.