A note on calculi for non-deterministic many-valued logics
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2021
- DOI:
- 10.48550/arXiv.2112.07377
- arXiv:
- arXiv:2112.07377
- Bibcode:
- 2021arXiv211207377K
- Keywords:
-
- Computer Science - Logic in Computer Science
- E-Print:
- Fundamenta Informaticae, Volume 186, Issues 1-4: Trakhtenbrot's centenary (January 2, 2023) fi:8847