Explicit, Implicit and Derivable Belief in Hyperintensional Algorithmic Semantics
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Conference abstract |
| MU Faculty or unit | |
| Citation | |
| Description | In the first part of the talk, I show why possible world semantics must be abandoned in favour of hyperintensional semantics, while I focus mainly on the logical omniscience problem. In the second part of the talk, I propose a hyperintensional algorithmic semantics, namely THL. I show that analysis of belief sentences by THL is an explicit model of belief; it blocks undesirable consequences. I also propose how to analyze by THL so-called implicit belief, for which I define the notion of derivable belief, which is the belief an agent can derive within the derivation system she masters. |
| Related projects: |