Search the dblp DataBase
Giorgi Japaridze :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Giorgi Japaridze The logic of tasks. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2002, v:117, n:1-3, pp:261-293 [Journal ] Giorgi Japaridze Introduction to computability logic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:1-99 [Journal ] Giorgi Japaridze A Constructive Game Semantics for the Language of Linear Logic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:85, n:2, pp:87-156 [Journal ] Giorgi Japaridze Propositional computability logic I [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Giorgi Japaridze Computability Logic: a formal theory of interaction [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Giorgi Japaridze Propositional Computability Logic II [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Giorgi Japaridze From truth to computability I [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Giorgi Japaridze Intuitionistic computability logic I [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Giorgi Japaridze Introduction to Cirquent Calculus and Abstract Resource Semantics. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 2006, v:16, n:4, pp:489-532 [Journal ] Giorgi Japaridze The Propositional Logic of Elementary Tasks. [Citation Graph (0, 0)][DBLP ] Notre Dame Journal of Formal Logic, 2000, v:41, n:2, pp:171-183 [Journal ] Giorgi Japaridze A Simple Proof of Arithmetical Completeness for Pi1 -conservativity Logic. [Citation Graph (0, 0)][DBLP ] Notre Dame Journal of Formal Logic, 1994, v:35, n:3, pp:346-354 [Journal ] Giorgi Japaridze From truth to computability I. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:357, n:1-3, pp:100-135 [Journal ] Giorgi Japaridze Propositional computability logic II. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2006, v:7, n:2, pp:331-362 [Journal ] Giorgi Japaridze Propositional computability logic I. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2006, v:7, n:2, pp:302-330 [Journal ] Giorgi Japaridze The intuitionistic fragment of computability logic at the propositional level. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2007, v:147, n:3, pp:187-227 [Journal ] Giorgi Japaridze Four concepts and two logics of algorithmic reduction [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Giorgi Japaridze The intuitionistic fragment of computability logic at the propositional level [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Giorgi Japaridze From truth to computability II [Citation Graph (0, 0)][DBLP ] CoRR, 2005, v:0, n:, pp:- [Journal ] Giorgi Japaridze Cirquent calculus deepened [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Giorgi Japaridze From truth to computability II. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:379, n:1-2, pp:20-52 [Journal ] Intuitionistic computability logic. [Citation Graph (, )][DBLP ] In the beginning was game semantics [Citation Graph (, )][DBLP ] The logic of interactive Turing reduction [Citation Graph (, )][DBLP ] Sequential operators in computability logic [Citation Graph (, )][DBLP ] Towards applied theories based on computability logic [Citation Graph (, )][DBLP ] Ptarithmetic [Citation Graph (, )][DBLP ] Toggling operators in computability logic [Citation Graph (, )][DBLP ] From formulas to cirquents in computability logic [Citation Graph (, )][DBLP ] A logical basis for constructive systems [Citation Graph (, )][DBLP ] Introduction to clarithmetic I [Citation Graph (, )][DBLP ] Introduction to clarithmetic II [Citation Graph (, )][DBLP ] Separating the basic logics of the basic recurrences [Citation Graph (, )][DBLP ] Introduction to clarithmetic III [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.305secs