Relating Semantics for Hyper-Connexive and Totally Connexive Logics
-
Published:2023-06-21
Issue:
Volume:
Page:1-14
-
ISSN:2300-9802
-
Container-title:Logic and Logical Philosophy
-
language:
-
Short-container-title:LLP
Author:
Malinowski Jacek,
Nicolás-Francisco Ricardo ArturoORCID
Abstract
In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.
Publisher
Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Connexive Negation;Studia Logica;2023-11-10