TitleConditionally knowing what
AuthorsWang, Yanjing
Fan, Jie
AffiliationDepartment of Philosophy, Peking University, China
Issue Date2014
Citation10th Conference on Advances in Modal Logic, AiML 2014.Groningen, Netherlands,10(569-587).
AbstractClassic epistemic logic focuses on propositional knowledge expressed by \knowing that' operators. However, there are various types of knowledge used in natural language, in terms of \knowing how', knowing whether', \knowing what', and so on. In [10], Plaza proposed an intuitive know-what operator which was generalized in [16] by introducing a condition. The latter know-what operator can express natural conditional knowledge such as \I know what your password is, if it is 4-digits', which is not simply a material implication. Essentially this know-what operator packages a first-order quantifier and an S5-modality together in a non-trivial way, thus making it hard to axiomatize. In [16] an axiomatization is given for the single-agent epistemic logic with both know-that and know-what operators, while leaving axiomatizing the multi-agent case open due to various technical difficulties. In this paper, we solve this open problem. The completeness proof is highly non-trivial, compared to the singleagent case, which requires different techniques inspired by first-order intensional logic.
Appears in Collections:哲学系(宗教学系)

Files in This Work
There are no files associated with this item.

Web of Science®

Checked on Last Week


Checked on Current Time

License: See PKU IR operational policies.