Connexive Implications in Substructural Logics

Review of Symbolic Logic 17 (3):878-909 (2024)
  Copy   BIBTEX

Abstract

This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FL ${}_{\scriptsize\mbox{e}}$ -algebras). In particular, we inquire into sufficient and necessary conditions under which generalizations of the connexive implication-like operation defined in [6] for Heyting algebras still satisfy connexive theses. It will turn out that, in most cases, connexive principles are equivalent to the equational Glivenko property with respect to Boolean algebras. Furthermore, we provide some philosophical upshots like, e.g., a discussion on the relevance of the above operation in relationship with G. Polya’s logic of plausible inference, and some characterization results on weak and strong connexivity.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

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

Analytics

Added to PP
2023-07-26

Downloads
19 (#1,080,556)

6 months
6 (#873,397)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Experiments on Aristotle’s Thesis.Niki Pfeifer - 2012 - The Monist 95 (2):223-240.
The Logic of Conditional Negation.John Cantwell - 2008 - Notre Dame Journal of Formal Logic 49 (3):245-260.
Contra-classical logics.Lloyd Humberstone - 2000 - Australasian Journal of Philosophy 78 (4):438 – 474.

View all 23 references / Add more references