Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Logics_for_computability> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items 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.".
- Logics_for_computability wikiPageExternalLink cl.html.
- Logics_for_computability wikiPageExternalLink LTC.
- Logics_for_computability wikiPageExternalLink ~japaridz.
- Logics_for_computability wikiPageExternalLink gsoll.html.
- Logics_for_computability wikiPageID "2673872".
- Logics_for_computability wikiPageRevisionID "602618412".
- Logics_for_computability hasPhotoCollection Logics_for_computability.
- Logics_for_computability subject Category:Systems_of_formal_logic.
- Logics_for_computability type Ability105616246.
- Logics_for_computability type Abstraction100002137.
- Logics_for_computability type Cognition100023271.
- Logics_for_computability type Know-how105616786.
- Logics_for_computability type Logic105664069.
- Logics_for_computability type Method105660268.
- Logics_for_computability type PsychologicalFeature100023100.
- Logics_for_computability type System105661996.
- Logics_for_computability type SystemsOfFormalLogic.
- Logics_for_computability comment "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.".
- Logics_for_computability label "Logics for computability".
- Logics_for_computability sameAs m.07x15f.
- Logics_for_computability sameAs Q17141220.
- Logics_for_computability sameAs Q17141220.
- Logics_for_computability sameAs Logics_for_computability.
- Logics_for_computability wasDerivedFrom Logics_for_computability?oldid=602618412.
- Logics_for_computability isPrimaryTopicOf Logics_for_computability.