The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Giorgi Japaridze: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Giorgi Japaridze
    Propositional computability logic I [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  5. Giorgi Japaridze
    Computability Logic: a formal theory of interaction [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  6. Giorgi Japaridze
    Propositional Computability Logic II [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. Giorgi Japaridze
    From truth to computability I [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  8. Giorgi Japaridze
    Intuitionistic computability logic I [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Giorgi Japaridze
    Propositional computability logic II. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:2, pp:331-362 [Journal]
  14. Giorgi Japaridze
    Propositional computability logic I. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:2, pp:302-330 [Journal]
  15. 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]
  16. Giorgi Japaridze
    Four concepts and two logics of algorithmic reduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  17. Giorgi Japaridze
    The intuitionistic fragment of computability logic at the propositional level [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  18. Giorgi Japaridze
    From truth to computability II [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  19. Giorgi Japaridze
    Cirquent calculus deepened [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  20. 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]

  21. Intuitionistic computability logic. [Citation Graph (, )][DBLP]


  22. In the beginning was game semantics [Citation Graph (, )][DBLP]


  23. The logic of interactive Turing reduction [Citation Graph (, )][DBLP]


  24. Sequential operators in computability logic [Citation Graph (, )][DBLP]


  25. Towards applied theories based on computability logic [Citation Graph (, )][DBLP]


  26. Ptarithmetic [Citation Graph (, )][DBLP]


  27. Toggling operators in computability logic [Citation Graph (, )][DBLP]


  28. From formulas to cirquents in computability logic [Citation Graph (, )][DBLP]


  29. A logical basis for constructive systems [Citation Graph (, )][DBLP]


  30. Introduction to clarithmetic I [Citation Graph (, )][DBLP]


  31. Introduction to clarithmetic II [Citation Graph (, )][DBLP]


  32. Separating the basic logics of the basic recurrences [Citation Graph (, )][DBLP]


  33. Introduction to clarithmetic III [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002