A Family of Strict/Tolerant Logics

被引:0
|
作者
Melvin Fitting
机构
[1] City University of New York,Departments of Philosophy, Computer Science, Mathematics (all emeritus), The Graduate Center
来源
Journal of Philosophical Logic | 2021年 / 50卷
关键词
Strict/Tolerant; Bilattice; Many valued logic; Kleene logic; Logic of paradox; First degree entailment;
D O I
暂无
中图分类号
学科分类号
摘要
Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … consequence levels in Barrio et al. (2019). In my earlier paper Fitting (2019) I showed that the original ideas behind ST are, in fact, much more general than first appeared, and an infinite family of many valued logics have Strict/Tolerant counterparts. This family includes both Kleene’s and Priest’s logic individually, as well as first degree entailment. For instance, for both the Kleene and the Priest logic, the corresponding strict/tolerant logic is six-valued, but with differing sets of strictly and tolerantly designated truth values. The present paper extends that generalization in two directions. We examine a reverse notion, of Tolerant/Strict logics, which exist for the same structures that were investigated in Fitting (2019). And we show that the generalization extends through the meta, metameta, … consequence levels for the same infinite family of many valued logics. Finally we close with remarks on the status of cut and related rules, which can actually be rather nuanced. Throughout, the aim is not the philosophical applications of the Strict/Tolerant idea, but the determination of how general a phenomenon it is.
引用
收藏
页码:363 / 394
页数:31
相关论文
共 50 条
  • [31] Strict and tolerant antidivision queries with ordinal layered preferences
    Bosc, Patrick
    Pivert, Olivier
    Soufflet, Olivier
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2011, 52 (01) : 38 - 48
  • [32] Similarity-Based Inconsistency-Tolerant Logics
    Arieli, Ofer
    Zamansky, Anna
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010, 2010, 6341 : 11 - 23
  • [33] Minimal inconsistency-tolerant logics: a quantitative approach
    Strasser, Christian
    Molick, Sanderson
    AUSTRALASIAN JOURNAL OF LOGIC, 2025, 22 (03)
  • [34] Reasoning with Inconsistency-tolerant Fuzzy Description Logics
    Kamide, Norihiro
    ICAART: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 3, 2022, : 63 - 74
  • [35] A family of strict and discontinuous triangular norms
    Budinevic, M
    Kurilic, MS
    FUZZY SETS AND SYSTEMS, 1998, 95 (03) : 381 - 384
  • [36] STRICT SETTLEMENT AND THE FAMILY - A DIFFERING VIEW
    BONFIELD, L
    ECONOMIC HISTORY REVIEW, 1988, 41 (03): : 461 - 466
  • [37] Optimality Theory as a Family of Cumulative Logics
    Ph. Besnard
    G. Fanselow
    T. Schaub
    Journal of Logic, Language and Information, 2003, 12 (2) : 153 - 182
  • [38] Family of extended dynamic description logics
    Chang L.
    Shi Z.-Z.
    Chen L.-M.
    Niu W.-J.
    Ruan Jian Xue Bao/Journal of Software, 2010, 21 (01): : 1 - 13
  • [39] A family of temporal logics on finite trees
    Esik, Zoltan
    Ivan, Szabolcs
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2010, 77 (3-4): : 277 - 297
  • [40] A family of extended fuzzy description logics
    Li, YH
    Xu, BW
    Lu, JJ
    Kang, DZ
    Wang, P
    PROCEEDINGS OF THE 29TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, 2005, : 221 - 226