HUMBLE CONNEXIVITY

被引:23
作者
Kapsner, Andreas [1 ]
机构
[1] Ludwig Maximilian Univ Munich, Fac Philosophy Philosophy Sci & Study Relig, Munich Ctr Math Philosophy, Munich, Germany
关键词
connexive logic; strong connexivity; unsatisfiability; paraconsistency; conditional logic; modal logic; CANCELLATION; NEGATION;
D O I
10.12775/LLP.2019.001
中图分类号
B81 [逻辑学(论理学)];
学科分类号
010104 ; 010105 ;
摘要
In this paper, I review the motivation of connexive and strongly connexive logics, and I investigate the question why it is so hard to achieve those properties in a logic with a well motivated semantic theory. My answer is that strong connexivity, and even just weak connexivity, is too stringent a requirement. I introduce the notion of humble connexivity, which in essence is the idea to restrict the connexive requirements to possible antecedents. I show that this restriction can be well motivated, while it still leaves us with a set of requirements that are far from trivial. In fact, formalizing the idea of humble connexivity is not as straightforward as one might expect, and I offer three different proposals. I examine some well known logics to determine whether they are humbly connexive or not, and I end with a more wide-focused view on the logical landscape seen through the lens of humble connexivity.
引用
收藏
页码:513 / 536
页数:24
相关论文
共 20 条
[1]  
[Anonymous], 1968, IFS
[2]  
Carnap R., 1947, Meaning and Necessity
[3]  
Estrada-González L, 2016, J APPL LOG-IFCOLOG, V3, P341
[4]   Counterfactuals in Nelson Logic [J].
Kapsner, Andreas ;
Omori, Hitoshi .
LOGIC, RATIONALITY, AND INTERACTION, LORI 2017, 2017, 10455 :497-511
[5]   Strong Connexivity [J].
Kapsner, Andreas .
THOUGHT-A JOURNAL OF PHILOSOPHY, 2012, 1 (02) :141-145
[6]  
Kapsner A, 2014, TRENDS LOG STUD LOG, V40, P1, DOI 10.1007/978-3-319-05206-9_1
[7]  
Leahy B., 2011, P SALT 21, P257, DOI DOI 10.3765/SALT.V21I0.2613
[8]  
Lewis D., 1973, Counterfactuals
[9]  
MAKINSON D, 1966, AUSTRALAS J PHILOS, V44, P331
[10]  
McCall S., 1975, ENTAILMENT LOGIC REL, V1