Meaning and Computing: Two Approaches to Computable Propositions

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985955%3A_____%2F21%3A00546956" target="_blank" >RIV/67985955:_____/21:00546956 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-88853-4_7" target="_blank" >https://doi.org/10.1007/978-3-030-88853-4_7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-88853-4_7" target="_blank" >10.1007/978-3-030-88853-4_7</a>

Result language
angličtina
Original language name
Meaning and Computing: Two Approaches to Computable Propositions
Original language description
In this paper, we will be interested in the notion of a computable proposition. It allows for feasible computational semantics of empirical sentences, despite the fact that it is in general impossible to get to the truth value of a sentence through a series of effective computational steps. Specifically, we will investigate two approaches to the notion of a computable proposition based on constructive type theory and transparent intensional logic. As we will see, the key difference between them is their accounts of denotations of empirical sentences.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
60301 - Philosophy, History and Philosophy of science and technology

Project
<a href="/en/project/GA19-12420S" target="_blank" >GA19-12420S: Hyperintensional Meaning, Type Theory and Logical Deduction</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)