Abstract

We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. In the first part, we also identify axioms of Epstein’s logics that, together with the connexive principles, lead to contradiction. Moreover, we present some principles that will be equivalent to the connexive theses, but not to the content connexive theses we will propose. In the second part, we focus on the semantic analysis provided by relating- and set-assignment models. We define sound and complete relating semantics for all tested systems. We also indicate alternative relating models for the smallest BCL, which are not alternative models of the connexive counterparts of the considered CRLs. We provide a set-assignment semantics for some BCLs, giving thus a natural formalization of the content relationship understood either as content sharing or as content inclusion.