Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14210%2F17%3A00100708" target="_blank" >RIV/00216224:14210/17:00100708 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.12775/LLP.2017.010" target="_blank" >http://dx.doi.org/10.12775/LLP.2017.010</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.12775/LLP.2017.010" target="_blank" >10.12775/LLP.2017.010</a>

Result language
angličtina
Original language name
Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach
Original language description
In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory (CTT), which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic (TIL), which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to TIL-based approach. The focus will be on non-empirical (i.e., mathematical and logical) problems only.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
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
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)