Computability Logic: a formal theory of interaction
作者： Giorgi Japaridze
关键词:
摘要: … , computability logic conservatively extends classical logic to a … be computed, just as traditional logic is a systematic tool for … computer science, logic and mathematics audiences in mind. …
arxiv.org
harvard.edu
springer.com
sci-hub.st 参考文章(21)
Johan van van Benthem, Logic in Games ,(2014)
Kurt Konolige, On the relation between autoepistemic logic and circumscription international joint conference on artificial intelligence. pp. 1213- 1218 ,(1989)
Dina Q Goldin, Persistent Turing Machines as a Model of Interactive Computation Lecture Notes in Computer Science. pp. 116- 135 ,(2000) , 10.1007/3-540-46564-2_8
Giorgi Japaridze, Intuitionistic computability logic Acta Cybernetica. ,vol. 18, pp. 77- 113 ,(2007)
Hector J. Levesque, Gerhard Lakemeyer, The logic of knowledge bases ,(2000)
Peter Wegner, Interactive foundations of computing Theoretical Computer Science. ,vol. 192, pp. 315- 351 ,(1998) , 10.1016/S0304-3975(97)00154-0
Giorgi Japaridze, From truth to computability II Theoretical Computer Science. ,vol. 379, pp. 100- 135 ,(2006) , 10.1016/J.TCS.2006.03.014
Michael Sipser, Introduction to the Theory of Computation ,(1997)
Andreas Blass, A game semantics for linear logic Annals of Pure and Applied Logic. ,vol. 56, pp. 183- 220 ,(1992) , 10.1016/0168-0072(92)90073-9
Giorgi Japaridze, Introduction to computability logic Annals of Pure and Applied Logic. ,vol. 123, pp. 1- 99 ,(2003) , 10.1016/S0168-0072(03)00023-X