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.

翻译：我们提出了两种非决定性的多种价值逻辑的计算等量计算法,一种由轴法定义,另一种由推理规则定义,两种计算法直接取自所考虑逻辑的真相表格,我们证明计算法的正确性和完整性理论,并证明根据推理规则界定的计算法的削减消除理论。