Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T02:50:24.897Z Has data issue: false hasContentIssue false

CONTINGENCY AND KNOWING WHETHER

Published online by Cambridge University Press:  09 January 2015

JIE FAN*
Affiliation:
Department of Philosophy, Peking University
YANJING WANG*
Affiliation:
Department of Philosophy, Peking University
HANS VAN DITMARSCH*
Affiliation:
LORIA-CNRS/Univeristy of Lorraine
*
*DEPARTMENT OF PHILOSOPHY, PEKING UNIVERSITY, BEIJING 100871, CHINA E-mail: fanjie@pku.edu.cn
†DEPARTMENT OF PHILOSOPHY, PEKING UNIVERSITY, BEIJING 100871, CHINA E-mail: y.wang@pku.edu.cn
‡LORIA-CNRS/UNIVERSITY OF LORRAINE, 54506 VANDUVRE-LÈS-NANCY, FRANCE E-mail: hans.van-ditmarsch@loria.fr
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.

A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an epistemic context, ‘a proposition is noncontingent’ means that you know whether the proposition is true. In this paper, we study contingency logic with the noncontingency operator Δ but without the necessity operator □. This logic is not a normal modal logic, because Δ(φ → ψ) → (Δφ → Δψ) is not valid. Contingency logic cannot define many usual frame properties, and its expressive power is weaker than that of basic modal logic over classes of models without reflexivity. These features make axiomatizing contingency logics nontrivial, especially for the axiomatization over symmetric frames. In this paper, we axiomatize contingency logics over various frame classes using a novel method other than the methods provided in the literature, based on the ‘almost-definability’ schema AD proposed in our previous work. We also present extensions of contingency logic with dynamic operators. Finally, we compare our work to the related work in the fields of contingency logic and ignorance logic, where the two research communities have similar results but are apparently unaware of each other’s work. One goal of our paper is to bridge this gap.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2014