Abstract
We present two deductively equivalent calculi for non-deterministic many-valued logics. One is defined by axioms and the other – by rules of inference. The two calculi are obtained from the truth tables of the logic under consideration in a straightforward manner. We prove soundness and strong completeness theorems for both calculi and also prove the cut elimination theorem for the calculi defined by rules of inference.
Get full access to this article
View all access options for this article.