Intuitionistic computability logic
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2007
|
| Sorozat: | Acta cybernetica
18 No. 1 |
| Kulcsszavak: | Természettudomány, Informatika |
| Online Access: | http://acta.bibl.u-szeged.hu/12805 |
| LEADER | 01823nab a2200205 i 4500 | ||
|---|---|---|---|
| 001 | acta12805 | ||
| 005 | 20210324140502.0 | ||
| 008 | 161015s2007 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Japaridze Giorgi | |
| 245 | 1 | 0 | |a Intuitionistic computability logic |h [elektronikus dokumentum] / |c Japaridze Giorgi |
| 260 | |c 2007 | ||
| 300 | |a 77-113 | ||
| 490 | 0 | |a Acta cybernetica |v 18 No. 1 | |
| 520 | 3 | |a Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understood as algorithmic solvability, CL potentially offers a comprehensive logical basis for constructive applied theories and computing systems inherently requiring constructive and computationally meaningful underlying logics. Among the best known constructivistic logics is Heyting's intuitionistic calculus INT, whose language can be seen as a special fragment of that of CL. The constructivistic philosophy of INT, however, just like the resource philosophy of linear logic, has never really found an intuitively convincing and mathematically strict semantical justification. CL has good claims to provide such a justification and hence a materialization of Kolmogorov's known thesis "INT = logic of problems". The present paper contains a soundness proof for INT with respect to the CL semantics. | |
| 695 | |a Természettudomány, Informatika | ||
| 710 | |a Kalmár Workshop on Logic in Computer Science, 2003, Szeged | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12805/1/Japaridze_2007_ActaCybernetica.pdf |z Dokumentum-elérés |