Matches in DBpedia 2016-04 for { ?s ?p "Logics for computability are formulations of logic whichcapture some aspect of computability as a basic notion. This usually involves a mixof special logical connectives as well as semantics which explains how the logic is to be interpreted in a computational way.Probably the first formal treatment of logic for computability is the realizability interpretation by Stephen Kleene in 1945, who gave an interpretation of intuitionistic number theory in terms of Turing machine computations. His motivation was to make precise the Heyting-Brouwer-Kolmogorov (BHK) interpretation of intuitionism, according to which proofs of mathematical statements are to be viewed as constructive procedures.With the rise of many other kinds of logic, such as modal logic and linear logic, and novel semantic models, such as game semantics, logics for computability have been formulated in several contexts. Here we mention two."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Logics_for_computability abstract "Logics for computability are formulations of logic whichcapture some aspect of computability as a basic notion. This usually involves a mixof special logical connectives as well as semantics which explains how the logic is to be interpreted in a computational way.Probably the first formal treatment of logic for computability is the realizability interpretation by Stephen Kleene in 1945, who gave an interpretation of intuitionistic number theory in terms of Turing machine computations. His motivation was to make precise the Heyting-Brouwer-Kolmogorov (BHK) interpretation of intuitionism, according to which proofs of mathematical statements are to be viewed as constructive procedures.With the rise of many other kinds of logic, such as modal logic and linear logic, and novel semantic models, such as game semantics, logics for computability have been formulated in several contexts. Here we mention two.".
- Q17141220 abstract "Logics for computability are formulations of logic whichcapture some aspect of computability as a basic notion. This usually involves a mixof special logical connectives as well as semantics which explains how the logic is to be interpreted in a computational way.Probably the first formal treatment of logic for computability is the realizability interpretation by Stephen Kleene in 1945, who gave an interpretation of intuitionistic number theory in terms of Turing machine computations. His motivation was to make precise the Heyting-Brouwer-Kolmogorov (BHK) interpretation of intuitionism, according to which proofs of mathematical statements are to be viewed as constructive procedures.With the rise of many other kinds of logic, such as modal logic and linear logic, and novel semantic models, such as game semantics, logics for computability have been formulated in several contexts. Here we mention two.".