Jie Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jie Fan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Yanjing Wang
Peking University
2 shared publications Hans van Ditmarsch
LORIA, CNRS, University of Lorraine, France
1 shared publication- Hans van Ditmarsch
University of Toulouse CNRS IRIT France
1 shared publication
Latest Publications
- 2 January 2016
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 26 (1) , 81-102
Propositional quantification in logics of contingency
In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of (non-)contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, our language primitive is the more suitable notion of public announcement whether, instead of the public announcement that. We compare the expressive power of our logic and its various fragments to related dynamic epistemic logics. We further present an axiomatisation and show its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic. Various extensions are also shown to be complete with respect to the corresponding frame classes.
- 2 January 2016
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 26 (1) , 81-102
Propositional quantification in logics of contingency
In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of (non-)contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, our language primitive is the more suitable notion of public announcement whether, instead of the public announcement that. We compare the expressive power of our logic and its various fragments to related dynamic epistemic logics. We further present an axiomatisation and show its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic. Various extensions are also shown to be complete with respect to the corresponding frame classes.
- 4 July 2015
- Published by Springer Nature
- p. 121-129
Epistemic Informativeness
- 9 January 2015
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 8 (1) , 75-107
CONTINGENCY AND KNOWING WHETHER
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 knowwhetherthe 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 oversymmetricframes. 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.
- 9 January 2015
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 8 (1) , 75-107
CONTINGENCY AND KNOWING WHETHER
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 knowwhetherthe 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 oversymmetricframes. 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.