Giorgi Japaridze

Research and Publications

 

NOTE: Before 1994 the English spelling of my name was "Dzhaparidze", the result of a two-step transliteration Georgian -> Russian -> English, while the current "Japaridze" is a direct transliteration from Georgian into English. Don't get confused if you need to look up my name in some earlier literature.


Main Contributions to Science

 

Provability and interpretability logics

(1985-1998)

Game semantics and the theory of interactive computation

(1997-present)

Proof theory and deep inference

(2006-present)

 

Complexity theory

(2009-present)

 


Publications

The combined size of the following items is 1480 pages.
  1. G.Japaridze,
    From formulas to cirquents in computability logic
    In: Annals of Pure and Applied Logic (under review). 42 pages.
            Official journal version    Online preprint 
  2. G.Japaridze,
    Toggling operators in computability logic
    In: Theoretical Computer Science (under review). 40 pages.
            Official journal version    Online preprint 
  3. G.Japaridze,
    Ptarithmetic
    In: Information and Computation (under review). 100 pages.
            Official journal version    Online preprint
  4. G.Japaridze,
    Towards applied theories based on computability logic
    In: Journal of Symbolic Logic (under review). 30 pages.
            Official journal version    Online preprint 

  5. G.Japaridze,
    Many concepts and two logics of algorithmic reduction
    In: Studia Logica 91 (2009), No.1,  pp. 1-24.
            Official journal version    Online preprint 

  6. G.Japaridze,
    In the beginning was game semantics
    In: Games: Unifying Logic, Language and Philosophy. O. Majer, A.-V. Pietarinen and T. Tulenheimo, eds. Springer 2009, pp. 249-350.  
            Official book version       Online preprint 

  7. G.Japaridze,
    Sequential operators in computability logic

    In: Information and Computation 206 (2008), No.12, pp. 1443-1475.  
            Official journal version    Online preprint 

  8. G.Japaridze,
    Cirquent calculus deepened
    In: Journal of Logic and Computation 18 (2008), No.6, pp. 983-1028. 
            Official journal version    Online preprint 

  9. G.Japaridze,
    The intuitionistic fragment of computability logic at the propositional level
    In: Annals of Pure and Applied Logic 147 (2007), No.3, pp. 187-227. 
            Official journal version    Online preprint 

  10. G.Japaridze,
    The logic of interactive Turing reduction
    In: Journal of Symbolic Logic 72 (2007), No.1, pp. 243-276.
            Official journal version    Online preprint

  11. G.Japaridze,
    Intuitionistic computability logic
    In: Acta Cybernetica 18 (2007), No. 1, pp. 77-113.
            Official journal version    Online preprint

  12. G.Japaridze,
    From truth to computability II
    In: Theoretical Computer Science 379 (2007), pp. 20-52.
            Official journal version    Online preprint 

  13. G.Japaridze,
    From truth to computability I
    In: Theoretical Computer Science 357 (2006), pp. 100-135.
            Official journal version    Online preprint
  14. G.Japaridze,
    Introduction to cirquent calculus and abstract resource semantics
    In: Journal of Logic and Computation 16 (2006), No.4, pp. 489-532.
            Official journal version    Online preprint

  15. G.Japaridze,
    Computability logic: a formal theory of interaction
    In: Interactive Computation: The New Paradigm. D.Goldin, S.Smolka and P.Wegner, eds. Springer Verlag, Berlin 2006, pp. 183-223.
     

  16. G.Japaridze,
    Propositional computability logic II
    In: ACM Transactions on Computational Logic 7 (2006), No. 2, pp. 331-362.
            Official journal version    Online preprint

  17. G.Japaridze,
    Propositional computability logic I
    In: ACM Transactions on Computational Logic 7 (2006) No.2, pp. 302-330.
            Official journal version    Online preprint

  18. G.Japaridze,
    The simplest completeness proof in computability logic
    In: Vriendboek ofwel Liber Amicorum ter gelegenheid van het afscheid van Dick de Jongh. Institute for Logic, Language and Computation, University of Amsterdam, 2004. 7 pages.

  19. G.Japaridze,
    A basic completeness theorem of CL.
    In: Bulletin of the Georgian Academy of Sciences 169 (2004), No.1, pp.34-36.

  20. G.Japaridze,
    A basic soundness theorem of CL.
    In: Bulletin of the Georgian Academy of Sciences 168 (2003), No.3, pp. 215-218.

  21. G.Japaridze,
    Introduction to computability logic
    In: Annals of Pure and Applied Logic, vol. 123 (2003), p. 1-99.
            Official journal version    Online preprint

  22. G.Japaridze,
    Some preliminary results on computability logic
    In: Proceedings of Kalmar Workshop on Logic and Computer Science. Szeged, Hungary, 2003. 15 pages.

  23. G.Japaridze,
    What is the real logic of games after all?
    In: Proceedings of the 3rd and 4th International Symposium on Language, Logic and Computation. D. De Jongh, H.Zeevat and M Nilsenova (EDS.). ILLCScientific Publications, Amsterdam, 2002, pp.243-257.

  24. G.Japaridze,
    Preliminary results on the basic predicate logic of racefree games.
    In: Bulletin of the Georgian Academy of Sciences 165 (2002), no. 2, pp.256-259.

  25. G.Japaridze,
    Preliminary results on the basic propositional logic of racefree games.
    In: Bulletin of the Georgian Academy of Sciences 165 (2002), no. 1, pp.26-29.

  26. G.Japaridze,
    The logic of tasks.
    In: Annals of Pure and Applied Logic 117 (2002), pp.263-295
            Official journal version     Online preprint 

  27. G.Japaridze,
    A decidable substructural predicate logic with a natural semantics.
    In: 4th Tbilisi Symposium on Language, Logic and Computation (abstracts) ILLC, University of Amsterdam / CLLS, Tbilisi State University, 2001, 5 pages. 5 pages. 5 pages. 5 pages. 5 pages.

  28. G.Japaridze,
    A task semantics for the language of linear logic
    In: Bulletin of the Georgian Academy of Sciences 163, N 1 (2001), pp. 5-7.

  29. G.Japaridze,
    The propositional logic of elementary tasks
    In: Notre Dame Journal of Formal Logic 41 (2000), N 2, pp.171-183.
            Official journal version      Online preprint

  30. G.Japaridze,
    A decidable first order epistemic logic
    In: Proceedings of the Georgian Academy of Sciences N 1/2 (2000), pp. 81-95.

  31. G.Japaridze and D.DeJongh
    The logic of provability.
    In: Handbook of Proof Theory, S.Buss, ed., North-Holland, 1998, pp.475-545.
            Official book version      Online preprint

  32. G.Japaridze,
    A constructive game semantics for the language of linear logic.
    In: Annals of Pure and Applied Logic 85 (1997), No. 2, pp.87-156.
            Official journal version   Online preprint

  33. G.Japaridze,
    A simple proof of arithmetical completeness for Pi-1 conservativity logic.
    In: Notre Dame Journal of Formal Logic 35 (1994), No 3. pp.346-354.
            Official journal version   Online preprint

  34. G.Japaridze,
    The logic of the arithmetical hierarchy.
    In: Annals of Pure and Applied Logic 66 (1994), No. 2, pp.89-112.

  35. G.Japaridze,
    A generalized notion of weak interpretability and the corresponding modal logic.
    In: Annals of Pure and Applied Logic 61 (1993), No. 1-2, pp.113-160.

  36. G.Japaridze,
    The logic of linear tolerance.
    In: Studia Logica 51 (1992), No 2, pp.249-277.
          Official journal version    Online preprint

  37. G.Japaridze,
    Predicate provability logic with non-modalized quantifiers.
    In: Studia Logica 50 (1991), No 1, pp.149-160.
          Official journal version    Online preprint

  38. G.Japaridze,
    Semidecidable fragments of first order provability logic.
    In: Semantical Analysis of Non-classical Logics. Tbilisi, Metsniereba, 1991, pp.63-79

  39. G.Japaridze,
    The logic of generalized weak interpretability.
    In: Bulletin of the Academy of Sciences of the Georgian SSR 143 (1991), No 3, pp.233-235.

  40. G.Japaridze,
    The propositional logic of truth and provability.
    In: Logic and Philosophic Essays. Moscow, 1991, pp. 43-52 (Russian).

  41. G.Japaridze,
    Decidable and enumerable predicate logics of provability.
    In: Studia Logica 49 (1990), N 1, pp.7-21.
          Official journal version    Online preprint

  42. S.Artemov and G.Japaridze,
    Finite Kripke models and predicate logics of provability.
    In: Journal of Symbolic Logic 55 (1990), N 3, pp.1090-1098.
         Official journal version    Online preprint

  43. G.Japaridze,
    Provability logic with modalities for arithmetical complexities.
    In: Bulletin of the Academy of Sciences of the Georgian SSR 138 (1990), No 3, pp.481-484.

  44. G.Japaridze,
    On predicate provability logics of nonenumerable theories.
    In: Suslin Mathematical Readings. Saratov, 1989, p.84 (Russian).

  45. G.Japaridze,
    The polymodal logic of provability.
    In: Intensional Logics and Logical Structure of Theories. Metsniereba, Tbilisi, 1988, pp.16-48. (Russian)

  46. G.Japaridze,
    The arithmetical completeness of provability logic with quantifier modalities.
    In:
    Bulletin of the Academy of Sciences of the Georgian SSR 132 (1988), No 2, pp.265-268.

  47. G.Japaridze,
    Quantifiers over realizations in provability logic.
    In: Semiotical Aspects of Formalization of the Intellectual Activity. Moscow, 1988, pp.81-83 (Russian).

  48. G.Japaridze,
    Quantifier modalities in provability logic.
    In: Proceedings of the 9th All Union Conference on Mathematical Logic. Leningrad, 1988, p.51 (Russian).

  49. S.Artemov and G.Japaridze,
    On effective predicate logics of provability.
    In: Doklady AN SSSR (now Dokady Mathematics) 297 (1987), No 3, pp.521-523 (Russian).
    English translation in: Soviet Math. Doklady 36, pp.478-480.

  50. G.Japaridze,
    Generalized provability principles and modal logic.
    In: Proceedings of the 8th International Congress on Logic, Methodology and Philosophy of Science. Moscow, 1987, volume 5, Part 1, pp.32-34.

  51. G.Japaridze and L.Mchedlishvili,
    Gottlob Frege: Begriffshrift
    In: Methods for Research in Logic, Metsniereba, Tbilisi, 1987, pp.83-151 (Russian)

  52. G.Japaridze,
    Proof theory and some modal systems.
    In: Methods of Logic Research. Tbilisi, Metsniereba, 1986, pp.39-47 (Russian).

  53. G.Japaridze,
    Modal logical means of studying provability
    Autoreferat of the candidate's thesis. Moscow State University, Moscow, 1986, 20 pages.

  54. G.Japaridze,
    Some modal systems with provability interpretation of the necessity operator.
    In: Logic and Methods of Analysis of the Scientific Knowledge. Moscow, 1986, pp.18-19 (Russian).

  55. G.Japaridze,
    GL as the intersection of truth provability logics.
    In: Proceedings of the 8th All Union Conference on Mathematical Logic. Moscow, 1986, p.58 (Russian).

  56. G.Japaridze,
    Provability principles and extensions of arithmetic.
    In: Nonstandard Semantics of Nonclassical Logics. Moscow, 1986, pp.89-98 (Russian).

  57. G.Japaridze,
    Necessity as provability.
    In: Izvestia (Annals) of the Academy of Sciences of the Georgian SSR (Philosophy and Psychology), 1986, No 3, pp.34-44 (Russian).

  58. G.Japaridze,
    N-provability reflected in a modal logic with infinitely many modal operators.
    In: Proceedings of the 4th Soviet-Finnish Symposium on Logic. Tbilisi, 1985, pp.56-57 (Russian).


Dissertations

  1. G.Japaridze,
    Modal-logical Means of Studying Provability.

    Ph.D. Thesis. Moscow State University, Moscow, 1987, 118 pages (Russian).

  2. G.Japaridze,
    The Logic of Resources and Tasks.

    PhD Thesis. University of Pennsylvania, Phladelphia, 1998, 145 pages.


Research Grants

(Principal Investigatior without co-PIs)

  1. Summer Research Fellowship and Grant from Villanova University
  2. NSF grant CCR-0208816 (Theory of Computing Program)
  3. Summer Research Fellowship from Villanova University


Major Citations

  1. I. Shapirovsky,
    "PSPACE-decidability of Japaridze's polymodal logic".
    In: Advances in Modal Logic 7 (2008), pp. 289-304.
     
  2. N.Vereshchagin,
    "Japaridze's computability logic and intuitionistic propositional calculus".
    Moscow State University preprint (Russian), 2006.
     
  3. L.D. Beklemishev, J.J. Joosten and M. Vervoort,
    "A finitary treatment of the closed fragment of Japaridze's provability logic".
    In: Journal of Logic and Computation 15 (2005), No 4, pp. 447-463.
  4. G. Boolos,
    "The analytical completeness of Japaridze's polymodal logics".
    In: Annals of Pure and Applied Logic 61 (1993), pp. 95-111.
  5. K. Ignatiev,
    "The closed fragment of Japaridze's polymodal logic and the logic of Sigma-1 conservativity".
    In: ITLI Prepublication Series for Mathematical Logic and Foundations, X-92-02, University of Amsterdam, 1992.
     
  6. K. Ignatiev,
    "Japaridze's polymodal logic: arithmetical completeness, fixed point property, Craig's property".
    In: ITLI Prepublication Series for Mathematical Logic and Foundations, X-90-13, University of Amsterdam, 1990.


Technical Reports and Unpublished Papers

  1. From formulas to cirquents in computability logic. arXiv:0906.2154. 2009. 40 pages.
  2. Toggling operators in computability logic. arXiv:0904.3469. 2009. 40 pages.
  3. Ptarithmetic. arXiv:0902.2969. 2009. 100 pages.
  4. Towards applied theories based on computability logic.  arXiv:0805.3521. 2008. 30 pages.
  5. Sequential operators in computability logic. arXiv:0712.1345, 2007. 40 pages.
  6. Cirquent calculus deepened. arXiv:0709.1308, 2007.  40 pages
  7. Many concepts and two logics of algorithmic reduction. arXiv:0706.0103, 2007. 15 pages.
  8. The intuitionistic fragment of computability logic at the propositional level. arXiv:cs.LO/0602011, 2006. 59 pages.
  9. The logic of interactive Turing reduction. arXiv:cs.LO/0512100, 2005. 38 pages.
  10. In the beginning was game semantics. arXiv:cs.LO/0507045, 2005. 111 pages.
  11. Introduction to cirquent calculus and abstract resource semantics. arXiv:math.LO/0506553, 2005. 50 pages.
  12. Intuitionistic computability logic. arXiv:cs.LO/0411008, 2004. 25 pages.
  13. From truth to computability I. arXiv:cs.LO/0407054, 2004. 64 pages.
  14. From truth to computability II. arXiv:cs.LO/0501031, 2005. 34 pages.
  15. Computability logic: a formal theory of interaction. arXiv:cs.LO/0404024, 2004. 26 pages.
  16. Propositional computability logic I. arXiv:cs.LO/0404023, 2004. 22 pages
  17. Propositional computability logic II. arXiv:cs.LO/0406037, 2004. 25 pages.
  18. A formalism for resource-oriented planning. IRCS Technical Reports 98-01 (1998), 38 pages.
  19. A decidable predicate logic of knowledge. IRCS Technical Reports 96-06 (1996), 20 pages.
  20. (With D.DeJongh) The logic of provability. ILLC Prepublication Series for Mathematical Logic and Foundations ML-1997-01.
  21. Effective truth. In: ILLC Prepublication Series for Mathematical Logic and Foundations ML-93-15 (1993), 25 pages.
  22. The logic of tolerance. ILLC Prepublication Series for Mathematical Logic and Foundations, X-1991-08.
  23. Determinism and freedom of will. This philosophical paper, written in Georgian, brought me the highest annual prize for student research in Georgia called "Medal from the Academy of Sciences of Georgian SSR" in 1982. I have never tried to publish the manuscript, although I regard it as the most important of my works. I am thinking of getting back to that exciting field in the (perhaps not very near) future and writing a book.


Computability Logic on the Web: