Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T14:16:31.950Z Has data issue: false hasContentIssue false

COMPLETENESS FOR COUNTER-DOXA CONDITIONALS – USING RANKING SEMANTICS

Published online by Cambridge University Press:  30 October 2018

ERIC RAIDL*
Affiliation:
Department of Philosophy, University of Konstanz
*
*DEPARTMENT OF PHILOSOPHY UNIVERSITY OF KONSTANZ POSTFACH D6, 78457 KONSTANZ, GERMANY E-mail: eric.3.raidl@uni-konstanz.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Standard conditionals $\varphi > \psi$, by which I roughly mean variably strict conditionals à la Stalnaker and Lewis, are trivially true for impossible antecedents. This article investigates three modifications in a doxastic setting. For the neutral conditional, all impossible-antecedent conditionals are false, for the doxastic conditional they are only true if the consequent is absolutely necessary, and for the metaphysical conditional only if the consequent is ‘model-implied’ by the antecedent. I motivate these conditionals logically, and also doxastically by properties of conditional belief and belief revision. For this I show that the Lewisian hierarchy of conditional logics can be reproduced within ranking semantics, provided we slightly stretch the notion of a ranking function. Given this, acceptance of a conditional can be interpreted as a conditional belief. The epistemic and the neutral conditional deviate from Lewis’ weakest system $V$, in that ID ($\varphi > \varphi$) or even CN ($\varphi > \top$) are dropped, and new axioms appear. The logic of the metaphysical conditional is completely axiomatised by $V$ to which we add the known Kripke axioms T5 for the outer modality. Related completeness results for variations of the ranking semantics are obtained as corollaries.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2018