Tree-Like Proof Systems for Finitely-Many Valued Non-deterministic Consequence Relations

被引:0
|
作者
Pawel Pawlowski
机构
[1] University of Gdansk,
[2] Ghent University,undefined
来源
Logica Universalis | 2020年 / 14卷
关键词
Non-deterministic logics; Proof systems; Many valued logics; Primary 03B60; 03B50;
D O I
暂无
中图分类号
学科分类号
摘要
The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
引用
收藏
页码:407 / 420
页数:13
相关论文
共 14 条