An Axiomatic System for Concessive Conditionals

Studia Logica 112 (1):343-363 (2023)
  Copy   BIBTEX

Abstract

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

Author Profiles

Raidl Eric
University Tübingen
Andrea Iacona
Università di Torino
Vincenzo Crupi
Università degli Studi di Torino

Analytics

Added to PP
2023-02-07

Downloads
130 (#92,138)

6 months
115 (#42,158)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?