Connexivity and the Pragmatics of Conditionals

Kapsner, Andreas

doi:10.1007/s10670-020-00325-1

Erkenn

2020

DOI: 10.1007/s10670-020-00325-1

|View full text |Cite

Connexivity and the Pragmatics of Conditionals

Andreas Kapsner

Abstract: In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice (and what that effect might be), however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An Easy Road to Multi-contra-classicality

Estrada-González

2021

Erkenn

View full text Add to dashboard Cite

A contra-classical logic is a logic that, over the same language as that of classical logic, validates arguments that are not classically valid. In this paper I investigate whether there is a single, non-trivial logic that exhibits many features of already known contra-classical logics. I show that Mortensen’s three-valued connexive logic M3V is one such logic and, furthermore, that following the example in building M3V , that is, putting a suitable conditional on top of the -fragment of LP , one can get a logic exhibiting even more contra-classical features.

show abstract

An Easy Road to Multi-contra-classicality

Estrada-González

2021

Erkenn

View full text Add to dashboard Cite

show abstract

Boolean Connexive Logic and Content Relationship

Klonowski,

Estrada-González

2023

Stud Logica

View full text Add to dashboard Cite

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.

show abstract

Connexive Implications in Substructural Logics

FAZIO,

ST. JOHN

2023

The Review of Symbolic Logic

View full text Add to dashboard Cite

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.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Connexivity and the Pragmatics of Conditionals

Cited by 4 publications

References 40 publications

An Easy Road to Multi-contra-classicality

An Easy Road to Multi-contra-classicality

Boolean Connexive Logic and Content Relationship

Connexive Implications in Substructural Logics

Contact Info

Product

Resources

About