English

Access-based Intuitionistic Knowledge

Logic in Computer Science 2021-02-25 v1

Abstract

We introduce the concept of access-based intuitionistic knowledge which relies on the intuition that agent ii knows φ\varphi if ii has found access to a proof of φ\varphi. Basic principles are distribution and factivity of knowledge as well as φKiφ\square\varphi\rightarrow K_i\varphi and Ki(φψ)(KiφKiψ)K_i(\varphi\vee\psi) \rightarrow (K_i\varphi\vee K_i\psi), where φ\square\varphi reads `φ\varphi is proved'. The formalization extends a family of classical modal logics designed in [Lewitzka 2015, 2017, 2019] as combinations of IPCIPC and CPCCPC and as systems for the reasoning about proof, i.e. intuitionistic truth. We adopt a formalization of common knowledge from [Lewitzka 2011] and interpret it here as access-based common knowledge. We compare our proposal with recent approaches to intuitionistic knowledge [Artemov and Protopopescu 2016; Lewitzka 2017, 2019] and bring together these different concepts in a unifying semantic framework based on Heyting algebra expansions.

Keywords

Cite

@article{arxiv.2006.15750,
  title  = {Access-based Intuitionistic Knowledge},
  author = {Steffen Lewitzka},
  journal= {arXiv preprint arXiv:2006.15750},
  year   = {2021}
}

Comments

28 pages