Logics for computability
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. 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.
- Comment
- enLogics 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. 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.
- Has abstract
- enLogics 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 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.
- Hypernym
- Formulations
- Is primary topic of
- Logics for computability
- Label
- enLogics for computability
- Link from a Wikipage to an external page
- www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/local-realizability-toposes-and-a-modal-logic-for-computability/31CB99D5D9210A9716EF4E7DFD4A204C
- web.archive.org/web/20110411024825/http:/www.cis.upenn.edu/~giorgi/cl.html
- web.archive.org/web/20160303174250/http:/www.csc.villanova.edu/~japaridz/CL/gsoll.html
- web.archive.org/web/20190419120954/http:/www.csc.villanova.edu/~japaridz/
- www.cs.cmu.edu/Groups/LTC/
- webspace.science.uu.nl/~ooste110/studsemIntMod/Kleene45.pdf
- www.sciencedirect.com/science/article/pii/S016800720300023X/pdf%3Fmd5=17a6ad155f7b48e1a9f8185b2852a372&pid=1-s2.0-S016800720300023X-main.pdf
- Link from a Wikipage to another Wikipage
- A. S. Troelstra
- BHK interpretation
- Category:Systems of formal logic
- Computability
- Computability logic
- Dana Scott
- Effective topos
- Game semantics
- Giorgi Japaridze
- Interactive computation
- Intuitionistic logic
- Lars Birkedal
- Linear logic
- Logical connective
- Martin Hyland
- Modal logic
- Realizability interpretation
- Semantics
- Stephen Kleene
- Steve Awodey
- Turing machine
- SameAs
- gBu6
- Lógica de computabilidade
- Logics for computability
- m.07x15f
- Q17141220
- Subject
- Category:Systems of formal logic
- WasDerivedFrom
- Logics for computability?oldid=1058013110&ns=0
- WikiPageLength
- 3541
- Wikipage page ID
- 2673872
- Wikipage revision ID
- 1058013110