English

An Epistemic Interpretation of Tensor Disjunction

Logic 2022-03-29 v1 Logic in Computer Science

Abstract

This paper aims to give an epistemic interpretation to the tensor disjunction in dependence logic, through a rather surprising connection to the so-called weak disjunction in Medvedev's early work on intermediate logic under the Brouwer-Heyting-Kolmogorov (BHK)-interpretation. We expose this connection in the setting of inquisitive logic with tensor disjunction discussed by Ciardelli and Barbero (2019}, but from an epistemic perspective. More specifically, we translate the propositional formulae of inquisitive logic with tensor into modal formulae in a powerful epistemic language of "knowing how" following the proposal by Wang (2021). We give a complete axiomatization of the logic of our full language based on Fine's axiomatization of S5 modal logic with propositional quantifiers. Finally, we generalize the tensor operator with parameters kk and nn, which intuitively captures the epistemic situation that one knows nn potential answers to nn questions and is sure kk answers of them must be correct. The original tensor disjunction is the special case when k=1k=1 and n=2n=2. We show that the generalized tensor operators do not increase the expressive power of our logic, the inquisitive logic, and propositional dependence logic, though most of these generalized tensors are not uniformly definable in these logics, except in our dynamic epistemic logic of knowing how.

Keywords

Cite

@article{arxiv.2203.13970,
  title  = {An Epistemic Interpretation of Tensor Disjunction},
  author = {Haoyu Wang and Yanjing Wang and Yunsong Wang},
  journal= {arXiv preprint arXiv:2203.13970},
  year   = {2022}
}

Comments

20 pages, under submission