Boolean Connexive Logic and Content Relationship

Studia Logica 112 (1):207-248 (2023)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Situation-Based Connexive Logic.Alessandro Giordani - 2023 - Studia Logica 112 (1):295-323.
Relating Semantics for Hyper-Connexive and Totally Connexive Logics.Jacek Malinowski & Ricardo Arturo Nicolás-Francisco - 2023 - Logic and Logical Philosophy (Special Issue: Relating Logic a):1-14.
A Variant of Material Connexive Logic.Alexander Belikov & Dmitry Zaitsev - 2022 - Bulletin of the Section of Logic 51 (2):227-242.
Stalnakerian Connexive Logics.Xuefeng Wen - 2023 - Studia Logica 112 (1):365-403.
Game Logic - An Overview.Marc Pauly & Rohit Parikh - 2003 - Studia Logica 75 (2):165-182.
A Simple Way to Overcome Hyperconnexivity.Alex Belikov - 2023 - Studia Logica 112 (1):69-94.
Logic, Language, and Information.L. T. F. Gamut - 1999 - Studia Logica 63 (2):269-272.


Added to PP

14 (#994,498)

6 months
9 (#315,924)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Mateusz Klonowski
Nicolaus Copernicus University
Luis Estrada-González
National Autonomous University of Mexico

Citations of this work

No citations found.

Add more citations

References found in this work

Strictness and connexivity.Andrea Iacona - 2021 - Inquiry: An Interdisciplinary Journal of Philosophy 64 (10):1024-1037.
Connexive implication.Storrs Mccall - 1966 - Journal of Symbolic Logic 31 (3):415-433.
A propositional logic with subjunctive conditionals.R. B. Angell - 1962 - Journal of Symbolic Logic 27 (3):327-343.

View all 20 references / Add more references