Počet záznamů: 1  

Meaning and Computing: Two Approaches to Computable Propositions

  1. 1.
    0546956 - FLÚ 2022 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
    Pezlar, Ivo
    Meaning and Computing: Two Approaches to Computable Propositions.
    Logic, Language, Information, and Computation. Cham: Springer, 2021 - (Silva, A.; Wassermann, R.; de Queiroz, R.), s. 100-116. Lecture Notes in Computer Science, 13038. ISBN 978-3-030-88852-7; ISBN 978-3-030-88853-4.
    [WoLLIC 2021. Workshop on Logic, Language, Information, and Computation /27./. online (NL), 05.10.2021-08.10.2021]
    Grant CEP: GA ČR(CZ) GA19-12420S
    Institucionální podpora: RVO:67985955
    Klíčová slova: computable proposition * sense–denotation distinction * algorithmic theory of meaning * procedural semantics * constructive type theory * transparent intensional logic
    Obor OECD: Philosophy, History and Philosophy of science and technology
    https://doi.org/10.1007/978-3-030-88853-4_7

    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.
    Trvalý link: http://hdl.handle.net/11104/0323337

     
     
Počet záznamů: 1