Logics For Computability - Modal Logic For Computability

Modal Logic For Computability

Kleene's original realizability interpretation has received much attention among those who study connections between computability and logic. It was extended to full higher-order intuitionistic logic by Martin Hyland in 1982 who constructed the effective topos. In 2002, Steven Awodey, Lars Birkedal, and Dana Scott formulated a modal logic for computability which extended the usual realizability interpretation with two modal operators expressing the notion of being "computably true".

Read more about this topic:  Logics For Computability

Famous quotes containing the word logic:

    Our argument ... will result, not upon logic by itself—though without logic we should never have got to this point—but upon the fortunate contingent fact that people who would take this logically possible view, after they had really imagined themselves in the other man’s position, are extremely rare.
    Richard M. Hare (b. 1919)