Paraconsistency and the need for infinite semantics

被引：1

作者：

Avron, Arnon ^{[1
]}

机构：

[1] Tel Aviv Univ, Sch Comp Sci, Tel Aviv, Israel

来源：

SOFT COMPUTING | 2019年 / 23卷 / 07期

基金：

以色列科学基金会;

关键词：

ENTAILMENT; RELEVANCE;

D O I：

10.1007/s00500-018-3272-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We show that most of the paraconsistent logics which have been investigated in the literature have no finite characteristic matrices, and in the most important cases not even finite characteristic non-deterministic matrices (Nmatrices).

引用

下载

页码：2167 / 2175

页数：9

共 50 条

[1] Paraconsistency and the need for infinite semantics
Arnon Avron
Soft Computing, 2019, 23 : 2167 - 2175
[2] Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics
Arieli, Ofer
Avron, Arnon
Zamansky, Anna
STUDIA LOGICA, 2011, 97 (01) : 31 - 60
[3] Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics
Ofer Arieli
Arnon Avron
Anna Zamansky
Studia Logica, 2011, 97 : 31 - 60
[4] PARACONSISTENCY
URBAS, I
STUDIES IN SOVIET THOUGHT, 1990, 39 (3-4): : 343 - 354
[5] ON INFINITE COMPUTATIONS IN DENOTATIONAL SEMANTICS
DEBAKKER, JW
MEYER, JJC
ZUCKER, JI
THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) : 53 - 82
[6] Logic Semantics with the Potential Infinite
Hailperin, Theodore
HISTORY AND PHILOSOPHY OF LOGIC, 2010, 31 (02) : 145 - 159
[7] THE NEED FOR CHARITY IN SEMANTICS
WARMBROD, K
PHILOSOPHICAL REVIEW, 1991, 100 (03): : 431 - 458
[8] SEMANTICS OF INFINITE TREE LOGIC PROGRAMMING
JAFFAR, J
STUCKEY, PJ
THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 141 - 158
[9] ASYNCHRONOUS SEMANTICS AND INFINITE BEHAVIORS FOR CSP
FAUCONNIER, H
THEORETICAL COMPUTER SCIENCE, 1987, 54 (2-3) : 277 - 298
[10] Infinite process semantics of inhibitor nets
Kleijn, H. C. M.
Koutny, M.
PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2006, 2006, 4024 : 282 - 301

← 1 2 3 4 5 →