Explicit, Implicit and Derivable Belief in Hyperintensional Algorithmic Semantics

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14210%2F16%3A00113941" target="_blank" >RIV/00216224:14210/16:00113941 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Explicit, Implicit and Derivable Belief in Hyperintensional Algorithmic Semantics

Original language 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.

Czech name

—

Czech description

—

Type

O - Miscellaneous

CEP classification

—

OECD FORD branch

60301 - Philosophy, History and Philosophy of science and technology

Project

<a href="/en/project/GA16-19395S" target="_blank" >GA16-19395S: Semantic notions, paradoxes and hyperintensional logic based on modern ramified theory of types</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů