On logic of paradox

Zuoquan Lin; Wei Li

On logic of paradox

Zuoquan Lin^*
, Wei Li

^*此作品的通讯作者

Shantou University

科研成果: 期刊稿件 › 会议文章 › 同行评审

1 引用（Scopus）

摘要

Priest [19] introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal paradox) LP_m is nonmonotonic in the sense that inconsistency is minimal. The problem of proof theory of logic LP_m left open because the base logic LP is paraconsistent so that syntactic formulations of nonmonotonic logic are not available for LP_m, though LP_m is well characterized by minimal semantics. In this paper, we will provide a minimal tableaux as a satisfactory proof theory for LP_m. We first present a signed tableaux for LP. Then minimal tableaux for LP_m is obtained by revising signed tableaux for LP to fit LP_m in which the branches of non-minimally-inconsistent models of the tableaux are eliminated. The soundness and completeness theorems of the tableaux with respect to the semantics of LP and LP_m are proved, respectively.

源语言	英语
页（从-至）	248-253
页数	6
期刊	Proceedings of The International Symposium on Multiple-Valued Logic
出版状态	已出版 - 1995
已对外发布	是
活动	Proceedings of the 1995 25th International Symposium on Multiple-Valued Logic - Bloomington, IN, USA 期限: 23 5月 1995 → 25 5月 1995

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{d877b88ced9344a89cb7041d61ca253c,

title = "On logic of paradox",

abstract = "Priest [19] introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal paradox) LPm is nonmonotonic in the sense that inconsistency is minimal. The problem of proof theory of logic LPm left open because the base logic LP is paraconsistent so that syntactic formulations of nonmonotonic logic are not available for LPm, though LPm is well characterized by minimal semantics. In this paper, we will provide a minimal tableaux as a satisfactory proof theory for LPm. We first present a signed tableaux for LP. Then minimal tableaux for LPm is obtained by revising signed tableaux for LP to fit LPm in which the branches of non-minimally-inconsistent models of the tableaux are eliminated. The soundness and completeness theorems of the tableaux with respect to the semantics of LP and LPm are proved, respectively.",

author = "Zuoquan Lin and Wei Li",

year = "1995",

language = "英语",

pages = "248--253",

journal = "Proceedings of The International Symposium on Multiple-Valued Logic",

issn = "0195-623X",

publisher = "IEEE Computer Society",

note = "Proceedings of the 1995 25th International Symposium on Multiple-Valued Logic ; Conference date: 23-05-1995 Through 25-05-1995",

}

TY - JOUR

T1 - On logic of paradox

AU - Lin, Zuoquan

AU - Li, Wei

PY - 1995

Y1 - 1995

N2 - Priest [19] introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal paradox) LPm is nonmonotonic in the sense that inconsistency is minimal. The problem of proof theory of logic LPm left open because the base logic LP is paraconsistent so that syntactic formulations of nonmonotonic logic are not available for LPm, though LPm is well characterized by minimal semantics. In this paper, we will provide a minimal tableaux as a satisfactory proof theory for LPm. We first present a signed tableaux for LP. Then minimal tableaux for LPm is obtained by revising signed tableaux for LP to fit LPm in which the branches of non-minimally-inconsistent models of the tableaux are eliminated. The soundness and completeness theorems of the tableaux with respect to the semantics of LP and LPm are proved, respectively.

AB - Priest [19] introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal paradox) LPm is nonmonotonic in the sense that inconsistency is minimal. The problem of proof theory of logic LPm left open because the base logic LP is paraconsistent so that syntactic formulations of nonmonotonic logic are not available for LPm, though LPm is well characterized by minimal semantics. In this paper, we will provide a minimal tableaux as a satisfactory proof theory for LPm. We first present a signed tableaux for LP. Then minimal tableaux for LPm is obtained by revising signed tableaux for LP to fit LPm in which the branches of non-minimally-inconsistent models of the tableaux are eliminated. The soundness and completeness theorems of the tableaux with respect to the semantics of LP and LPm are proved, respectively.

UR - https://www.scopus.com/pages/publications/0029217907

M3 - 会议文章

AN - SCOPUS:0029217907

SN - 0195-623X

SP - 248

EP - 253

JO - Proceedings of The International Symposium on Multiple-Valued Logic

JF - Proceedings of The International Symposium on Multiple-Valued Logic

T2 - Proceedings of the 1995 25th International Symposium on Multiple-Valued Logic

Y2 - 23 May 1995 through 25 May 1995

ER -

On logic of paradox

摘要

其它文件与链接

学术指纹

引用此