Relating Semantics for Hyper-Connexive and Totally Connexive Logics
Jacek Malinowski, Ricardo Arturo Nicolás-Francisco · Logic and Logical Philosophy · 2023
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.