Relating Semantics for Hyper-Connexive and Totally Connexive Logics
Open Access
- 21 June 2023
- journal article
- research article
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 33 (4) , 509-522
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.Keywords
This publication has 12 references indexed in Scilit:
- Axiomatization of Some Basic and Modal Boolean Connexive LogicsLogica Universalis, 2021
- Variable Sharing in Connexive LogicJournal of Philosophical Logic, 2021
- Relating Semantics as Fine-Grained Semantics for Intensional Logics2020
- Some Intensional Logics Defined by Relating Semantics and Tableau Systems2020
- Relating Semantics for Connexive Logic2020
- A Nelsonian Response to ‘the Most Embarrassing of All Twelfth-century Arguments’History and Philosophy of Logic, 2019
- Boolean Connexive Logics: Semantics and tableau approachLogic and Logical Philosophy, 2019
- Counterfactuals in Nelson Logic2017
- A History Of Connexivity2012
- A Note on Negation in Categorial GrammarLogic Journal of the IGPL, 2007