A note on calculi for non-deterministic many-valued logics

التفاصيل البيبلوغرافية
العنوان: A note on calculi for non-deterministic many-valued logics
المؤلفون: Kaminski, Michael
المصدر: Fundamenta Informaticae, Volume 186, Issues 1-4: Trakhtenbrot's centenary (January 2, 2023) fi:8847
سنة النشر: 2021
المجموعة: Computer Science
مصطلحات موضوعية: Computer Science - Logic in Computer Science
الوصف: 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.
نوع الوثيقة: Working Paper
URL الوصول: http://arxiv.org/abs/2112.07377
رقم الانضمام: edsarx.2112.07377
قاعدة البيانات: arXiv