Boolean Connexive Logics: Semantics and tableau approach
Open Access
- 27 January 2019
- journal article
- research article
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 28 (3) , 427-448
Abstract
In this paper we define a new type of connexive logics which we call Boolean connexive logics. In such logics negation, conjunction and disjunction behave in the classical, Boolean way. We determine these logics through application of the relating semantics. In the final section we present a tableau approach to the discussed logics.Keywords
This publication has 8 references indexed in Scilit:
- Logics of Nonsense and Parry SystemsJournal of Philosophical Logic, 2014
- Tableau Metatheorem for Modal Logics2014
- Strong ConnexivityThought: A Journal of Philosophy, 2012
- A History Of Connexivity2012
- The Semantic Foundations of Logic Volume 1: Propositional Logics1990
- Analytic implication.Notre Dame Journal of Formal Logic, 1986
- Philosophical basis of relatedness logicPhilosophical Studies, 1979
- Relatedness and implicationPhilosophical Studies, 1979