A note on calculi for non-deterministic many-valued logics
Logic in Computer Science
2023-06-22 v3
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.
Cite
@article{arxiv.2112.07377,
title = {A note on calculi for non-deterministic many-valued logics},
author = {Michael Kaminski},
journal= {arXiv preprint arXiv:2112.07377},
year = {2023}
}