Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Logics_for_computability> ?p ?o }
Showing triples 1 to 41 of
41
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.".
- 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 wikiPageLength "3002".
- Logics_for_computability wikiPageOutDegree "23".
- Logics_for_computability wikiPageRevisionID "630660723".
- Logics_for_computability wikiPageWikiLink Anne_Sjerp_Troelstra.
- Logics_for_computability wikiPageWikiLink Brouwer–Heyting–Kolmogorov_interpretation.
- Logics_for_computability wikiPageWikiLink Category:Systems_of_formal_logic.
- Logics_for_computability wikiPageWikiLink Computability.
- Logics_for_computability wikiPageWikiLink Computability_logic.
- Logics_for_computability wikiPageWikiLink Dana_Scott.
- Logics_for_computability wikiPageWikiLink Effective_topos.
- Logics_for_computability wikiPageWikiLink Game_semantics.
- Logics_for_computability wikiPageWikiLink Giorgi_Japaridze.
- Logics_for_computability wikiPageWikiLink Interactive_computation.
- Logics_for_computability wikiPageWikiLink Intuitionistic_logic.
- Logics_for_computability wikiPageWikiLink Lars_Birkedal.
- Logics_for_computability wikiPageWikiLink Linear_logic.
- Logics_for_computability wikiPageWikiLink Logical_connective.
- Logics_for_computability wikiPageWikiLink Martin_Hyland.
- Logics_for_computability wikiPageWikiLink Modal_logic.
- Logics_for_computability wikiPageWikiLink Realizability_interpretation.
- Logics_for_computability wikiPageWikiLink Semantics.
- Logics_for_computability wikiPageWikiLink Stephen_Cole_Kleene.
- Logics_for_computability wikiPageWikiLink Steven_Awodey.
- Logics_for_computability wikiPageWikiLink Turing_machine.
- Logics_for_computability wikiPageWikiLinkText "Logics for computability".
- Logics_for_computability subject Category:Systems_of_formal_logic.
- Logics_for_computability hypernym Formulations.
- 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 Q17141220.
- Logics_for_computability sameAs Lógica_de_computabilidade.
- Logics_for_computability sameAs m.07x15f.
- Logics_for_computability sameAs Q17141220.
- Logics_for_computability wasDerivedFrom Logics_for_computability?oldid=630660723.
- Logics_for_computability isPrimaryTopicOf Logics_for_computability.