Some computational constraints in epistemic logic
This paper concerns limits that some epistemic logics impose on the complexity of an epistemic agent's reasoning, rather than limits on the complexity of the epistemic logic itself.As an epistemic agent, one theorizes about a world which contains the theorizing of epistemic agents, including oneself. Epistemic logicians theorize about the abstract structure of epistemic agents' theorizing. This paper concerns the comparatively simple special case of epistemic logic in which only one agent is considered. Such an epistemic agent theorizes about a world which contains that agent's theorizing. One has knowledge about one's own knowledge, or beliefs about one's own beliefs. The considerations of this paper can be generalized to multi-agent epistemic logic, but that will not be done here. Formally, single-agent epistemic logic is just standard monomodal logic; we call it "epistemic" in view of the envisaged applications.
Williamson, T. (2016)., Some computational constraints in epistemic logic, in H. Arló-Costa, V. F. Hendricks & J. Van Benthem (eds.), Readings in formal epistemology, Dordrecht, Springer, pp. 717-734.
This document is unfortunately not available for download at the moment.