Curriculum Vitae

CONTACT INFORMATION Address: Computing Sciences Department, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA. Email: [email protected] Telephone: (1) 610 519 7332 Fax: (1) 610 519 7889 Home page: http://www.csc.villanova.edu/~japaridz/

EDUCATION

1998 Ph.D. Computer Science, University of Pennsylvania Dissertation: The of Resources and Tasks

1987 Ph.D. Logic, Moscow State University Dissertation: Modal-Logical Means of Studying Provability

1983 M.S. Philosophy, Tbilisi State University (, former USSR) Thesis: The Notion of in Formalized Languages

LANGUAGES: Georgian, Russian, English, Chinese (Mandarin), German.

EMPLOYMENT HISTORY

2008 - present Full Professor Computing Sciences Department, Villanova University, Villanova, PA, USA

2010 - 2013 Chair Professor School of Computer Science and Technology, Shandong University, Jinan, China

2004-2008 Associate Professor Computing Sciences Department, Villanova University, Villanova, PA, USA

2007 Visiting Professor School of Information Science and Technology, Institute of Artificial Intelligence, Xiamen University, Fujian, Xiamen, China

1998 -2003 Assistant Professor Computing Sciences Department, Villanova University, Villanova, PA, USA

1995-1998 Research Assistant Dept. of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA

1993-1994 Visiting Associate Professor Philosophy Department, University of Notre Dame, Notre Dame, IN, USA

1992-1993 Postdoctoral Fellow Dept. of Mathematics and Computer Science, University of Amsterdam, Amsterdam, The Netherlands

1987-1992 Senior Researcher Institute of Philosophy, Georgian Academy of Sciences, Tbilisi, Georgia (former USSR)

Main Contributions to Science

Provability and interpretability

(1985-1998)

 While a student, introduced polymodal provability logic GLP, and proved its arithmetical completeness. This contained a solution of an open problem on the logic of provability raised by George Boolos a decade earlier (1985-1988).  Introduced logic D and proved its arithmetical completeness (1987).  Extended Solovay's theorems from propositional level to the one-variable predicate level, and introduced the corresponding sound and complete logic GLq (1987).  Introduced the concepts of cointerpretability, tolerance and cotolerance (1992- 1993).  Proved that cointerpretability is equivalent to 1-conservativity and tolerance is equivalent to 1-consistency. This was an answer to the long-standing open problem regarding the metamathematical meaning of 1-conservativity (1992- 1993).  Introduced modal logics for tolerance and proved their arithmetical completeness (1993).  Introduced a modal logic for the arithmetical hierarchy and proved its arithmetical completeness (1994).

Game and the theory of interactive computation

(1997-present)

 Introduced the Logic of Tasks (2000-2002). It later became a part of on one hand, and a part of abstract on the other hand.  Introduced and started elaborating Computability Logic. This is work with a beginning but no end. An ambitious program and platform for redeveloping logic as a formal theory of (interactive) computability, as opposed to the formal theory of truth that it has more traditionally been (2003-2007).  Proved the soundness and completeness of with respect to the semantics of computability logic, thus corroborating Kolmogorov's (1932) well known yet rather abstract thesis, according to which intuitionistic logic is a logic of problems (2006-2007).  Introduced Abstract Resource Semantics (2006).

Proof theory and deep

(2006-present)

 Introduced the new proof-theoretic framework called Cirquent Calculus (2006- 2007).

Complexity theory

(2010-present)

 Introduced “Clarithmetics” --- computability-logic-based formal arithmetics for various computational complexity classes.

Publications 1. G.Japaridze, Introduction to clarithmetic III Annals of Pure and Applied Logic 165 (2014), pp. 241-252. Official journal version Online preprint 2. G.Japaridze, The taming of recurrences in computability logic through cirquent calculus, Part II Archive for 52 (2013), pp. 213-259. Official journal version Online preprint Author’s official copy 3. G.Japaridze, The taming of recurrences in computability logic through cirquent calculus, Part I Archive for Mathematical Logic 52 (2013), pp. 173-212. Official journal version Online preprint Author’s official copy 4. G.Japaridze, Ptarithmetic The Baltic International Yearbook on Cognition, Logic and Communication 8 (2013), Article 5, pp. 1-186. Official journal version (free access) 5. G.Japaridze, A new face of the branching recurrence of computability logic Applied Mathematics Letters 25 (2012), pp. 1585-1589. Official journal version Online preprint 6. G.Japaridze, A logical basis for constructive systems Journal of Logic and Computation 22 (2012), pp. 605-642. Official journal version (free access) 7. G.Japaridze, Separating the basic logics of the basic recurrences Annals of Pure and Applied Logic 163 (2012), pp. 377-389. Official journal version Online preprint 8. G.Japaridze, Introduction to clarithmetic I Information and Computation 209 (2011), pp. 1312-1354. Official journal version Online preprint 9. G.Japaridze, From formulas to cirquents in computability logic Logical Methods is Computer Science 7 (2011), Issue 2 , Paper 1, pp. 1-55. Official journal version (free access) 10. G.Japaridze, Toggling operators in computability logic Theoretical Computer Science 412 (2011), pp. 971-1004. Official journal version Online preprint 11. G.Japaridze, Towards applied theories based on computability logic Journal of Symbolic Logic 75 (2010), pp. 565-601. Official journal version Online preprint 12. G.Japaridze, Many concepts and two logics of algorithmic reduction Studia Logica 91 (2009), No.1, pp. 1-24. Official journal version Online preprint 13. G.Japaridze, In the beginning was game semantics 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 14. G.Japaridze, Sequential operators in computability logic Information and Computation 206 (2008), No.12, pp. 1443-1475. Official journal version Online preprint 15. G.Japaridze, Cirquent calculus deepened Journal of Logic and Computation 18 (2008), No.6, pp. 983-1028. Official journal version (free access) 16. G.Japaridze, The intuitionistic fragment of computability logic at the propositional level Annals of Pure and Applied Logic 147 (2007), No.3, pp. 187-227. Official journal version Online preprint 17. G.Japaridze, The logic of interactive Turing reduction Journal of Symbolic Logic 72 (2007), No.1, pp. 243-276. Official journal version Online preprint 18. G.Japaridze, Intuitionistic computability logic Acta Cybernetica 18 (2007), No. 1, pp. 77-113. Official journal version Online preprint 19. G.Japaridze, From truth to computability II Theoretical Computer Science 379 (2007), pp. 20-52. Official journal version Online preprint 20. G.Japaridze, From truth to computability I Theoretical Computer Science 357 (2006), pp. 100-135. Official journal version Online preprint 21. G.Japaridze, Introduction to cirquent calculus and abstract resource semantics Journal of Logic and Computation 16 (2006), No.4, pp. 489-532. Official journal version Online preprint 22. G.Japaridze, Computability logic: a formal theory of interaction Interactive Computation: The New Paradigm. D.Goldin, S.Smolka and P.Wegner, eds. Springer Verlag, Berlin 2006, pp. 183-223. Official book version Online preprint 23. G.Japaridze, Propositional computability logic II ACM Transactions on Computational Logic 7 (2006), No. 2, pp. 331-362. Official journal version Online preprint 24. G.Japaridze, Propositional computability logic I ACM Transactions on Computational Logic 7 (2006) No.2, pp. 302-330. Official journal version Online preprint 25. G.Japaridze, The simplest completeness proof in computability logic 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. 26. G.Japaridze, A basic completeness theorem of CL. Bulletin of the Georgian Academy of Sciences 169 (2004), No.1, pp. 34-36. 27. G.Japaridze, A basic soundness theorem of CL. Bulletin of the Georgian Academy of Sciences 168 (2003), No.3, pp. 215-218. 28. G.Japaridze, Introduction to computability logic Annals of Pure and Applied Logic, vol. 123 (2003), p. 1-99. Official journal version Online preprint 29. G.Japaridze, Some preliminary results on computability logic Proceedings of Kalmar Workshop on Logic and Computer Science. Szeged, Hungary, 2003. 15 pages. 30. G.Japaridze, What is the real logic of games after all? 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. 31. G.Japaridze, Preliminary results on the basic predicate logic of racefree games. Bulletin of the Georgian Academy of Sciences 165 (2002), No. 2, pp. 256-259. 32. G.Japaridze, Preliminary results on the basic propositional logic of racefree games. Bulletin of the Georgian Academy of Sciences 165 (2002), No. 1, pp. 26-29. 33. G.Japaridze, The logic of tasks. Annals of Pure and Applied Logic 117 (2002), pp. 261-293. Official journal version Online preprint 34. G.Japaridze, A decidable substructural predicate logic with a natural semantics. 4th Tbilisi Symposium on Language, Logic and Computation (abstracts) ILLC, University of Amsterdam / CLLS, Tbilisi State University, 2001, 5 pages. 35. G.Japaridze, A task semantics for the language of Bulletin of the Georgian Academy of Sciences 163, No. 1 (2001), pp. 5-7. 36. G.Japaridze, The propositional logic of elementary tasks Notre Dame Journal of Formal Logic 41 (2000), No. 2, pp. 171-183. Official journal version Online preprint 37. G.Japaridze, A decidable first order epistemic logic Proceedings of the Georgian Academy of Sciences No. 1-2 (2000), pp. 81-95. 38. G.Japaridze and D.DeJongh The logic of provability. Handbook of Proof Theory, S.Buss, ed., North-Holland, 1998, pp. 475-545. Official book version Online preprint 39. G.Japaridze, A constructive game semantics for the language of linear logic. Annals of Pure and Applied Logic 85 (1997), No. 2, pp. 87-156. Official journal version Online preprint 40. G.Japaridze, A simple proof of arithmetical completeness for Pi-1 conservativity logic. Notre Dame Journal of Formal Logic 35 (1994), No. 3. pp. 346-354. Official journal version Online preprint 41. G.Japaridze, The logic of the arithmetical hierarchy. Annals of Pure and Applied Logic 66 (1994), No. 2, pp. 89-112. 42. G.Japaridze, A generalized notion of weak interpretability and the corresponding modal logic. Annals of Pure and Applied Logic 61 (1993), No. 1-2, pp. 113-160. 43. G.Japaridze, The logic of linear tolerance. Studia Logica 51 (1992), No. 2, pp. 249-277. Official journal version Online preprint 44. G.Japaridze, Predicate provability logic with non-modalized quantifiers. Studia Logica 50 (1991), No. 1, pp. 149-160. Official journal version Online preprint 45. G.Japaridze, Semidecidable fragments of first order provability logic. Semantical Analysis of Non-classical Logics. Tbilisi, Metsniereba, 1991, pp. 63- 79 46. G.Japaridze, The logic of generalized weak interpretability. Bulletin of the Academy of Sciences of the Georgian SSR 143 (1991), No. 3, pp. 233-235. 47. G.Japaridze, The propositional logic of truth and provability. Logic and Philosophic Essays. Moscow, 1991, pp. 43-52 (Russian). 48. G.Japaridze, Decidable and enumerable predicate logics of provability. Studia Logica 49 (1990), No. 1, pp. 7-21. Official journal version Online preprint 49. S.Artemov and G.Japaridze, Finite Kripke models and predicate logics of provability. Journal of Symbolic Logic 55 (1990), No. 3, pp. 1090-1098. Official journal version Online preprint 50. G.Japaridze, Provability logic with modalities for arithmetical complexities. Bulletin of the Academy of Sciences of the Georgian SSR 138 (1990), No. 3, pp. 481-484. 51. G.Japaridze, On predicate provability logics of nonenumerable theories. Suslin Mathematical Readings. Saratov, 1989, p. 84 (Russian). 52. G.Japaridze, The polymodal logic of provability. Intensional Logics and Logical Structure of Theories. Metsniereba, Tbilisi, 1988, pp. 16-48 (Russian). 53. G.Japaridze, The arithmetical completeness of provability logic with quantifier modalities. Bulletin of the Academy of Sciences of the Georgian SSR 132 (1988), No. 2, pp. 265-268. 54. G.Japaridze, Quantifiers over realizations in provability logic. Semiotical Aspects of Formalization of the Intellectual Activity. Moscow, 1988, pp. 81-83 (Russian). 55. G.Japaridze, Quantifier modalities in provability logic. Proceedings of the 9th All Union Conference on Mathematical Logic. Leningrad, 1988, p. 51 (Russian). 56. S.Artemov and G.Japaridze, On effective predicate logics of provability. Doklady AN SSSR (now Dokady Mathematics) 297 (1987), No. 3, pp. 521-523 (Russian). English translation in: Soviet Math. Doklady 36, pp.478-480. 57. G.Japaridze, Generalized provability principles and modal logic. Proceedings of the 8th International Congress on Logic, Methodology and Philosophy of Science. Moscow, 1987, volume 5, Part 1, pp. 32-34. 58. G.Japaridze and L.Mchedlishvili, Gottlob Frege: Begriffshrift Methods for Research in Logic, Metsniereba, Tbilisi, 1987, pp. 83-151 (Russian). 59. G.Japaridze, Proof theory and some modal systems. Methods of Logic Research. Tbilisi, Metsniereba, 1986, pp. 39-47 (Russian). 60. G.Japaridze, Modal logical means of studying provability Autoreferat of the candidate's thesis. Moscow State University, Moscow, 1986, 20 pages. 61. G.Japaridze, Some modal systems with provability interpretation of the necessity operator. Logic and Methods of Analysis of the Scientific Knowledge. Moscow, 1986, pp. 18-19 (Russian). 62. G.Japaridze, GL as the intersection of truth provability logics. Proceedings of the 8th All Union Conference on Mathematical Logic. Moscow, 1986, p. 58 (Russian). 63. G.Japaridze, Provability principles and extensions of arithmetic. Nonstandard Semantics of Nonclassical Logics. Moscow, 1986, pp. 89-98 (Russian). 64. G.Japaridze, Necessity as provability. Izvestia (Annals) of the Academy of Sciences of the Georgian SSR (Philosophy and Psychology), 1986, No. 3, pp. 34-44 (Russian). 65. G.Japaridze, N-provability reflected in a modal logic with infinitely many modal operators. 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, Philadelphia, 1998, 145 pages.

Grants and Honors (Principal Investigator without co-PIs)

1. Outstanding Foreign Experts Program grant (China) o Duration: Summer 2012 2. Summer Research Fellowship and Grant from Villanova University o Project title: "Taming recurrences in computability logic". o Duration: Summer 2010 3. Summer Research Fellowship and Grant from Villanova University o Project title: "Intuitionistic computability logic". o Duration: Summer 2005 4. NSF grant CCR-0208816 (Theory of Computing Program) o Project title: "A logical study of interactive computational problems understood as games". o Duration: July 1, 2002 - June 30, 2006. 5. Summer Research Fellowship from Villanova University o Project title: "The logic of informational games" o Duration: Summer 1999 6. Dean's Fellowship from the University of Pennsylvania o Duration: 1994-95 7. Smullian Fellowship from Indiana University 1994 (declined by the recipient) o Duration: 1994-1998 8. Postdoctoral fellowship from the Dutch government o Duration: 1992-93 9. Medal and Prize from the Georgian Academy of Sciences for the best student research paper: o 1982

Major Citations

[Other authors’ papers focused on one of the following 4 brainchildren of Giorgi Japaridze: GLP (1985), Logic of Tasks (2002), Computability Logic (2003), Cirquent Calculus (2006)]

1. M.Bauer, “A PSPACE-complete first order fragment of computability logic”. ACM Transactions on Computational Logic 15 (2014), No 1, Paper A.

2. M.Bauer, “The computational complexity of propositional cirquent calculus”. arXiv:1401.1849 (2014). 3. W.Xu, “Axiomatizing Japaridze’s approach to IF logic”. arXiv:1402.4172 (2014).

4. “The computational complexity of propositional cirquent calculus”. arXiv:1401.1849 (2014).

5. L.Beklemishev and D.Gabelaia, “Topological completeness of provability logic GLP”. Annals of Pure and Applied Logic 164 (2013), pp. 1201-1223.

6. M.Qu, J.Luan, D.Zhu and M.Du, “On the toggling-branching recurrence of computability logic”. Journal of Computer Science and Technology 28 (2013), pp. 278-284.

7. W.Xu and S.Liu, “The parallel versus branching recurrences in computability logic”. Notre Dame Journal of Formal Logic 54 (2013), pp. 61-78.

8. C.Yu and W.Zhou, “Hierarchy organization model based on the logic of tasks”. Applied Mechanics and Materials 310 (2013), pp. 644-649.

9. W.Zhang, L.Zeng and S.Li, “Coordinative relationship model for groups organization based on the logic of tasks”. Computer Engineering and Science 35:1 (2013).

10. H.Kwon, “Expressing as concise as possible via computability logic”. arXiv:1305.2004 (2013).

11. F.Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”. arXiv:1305.6065 (2013).

12. Y.Zhang, “Time and Space Complexity Analysis for the System CL2 of Computability Logic”. MS Thesis (Chinese). Shandong University, 2013.

13. W.Xu, “On Some Operators and Systems of Computability Logic”. PhD Thesis (Chinese). Xidian University, 2012.

14. W.Xu and S.Liu, “The countable versus uncountable branching recurrences in computability logic”. Journal of Applied Logic 10 (2012), pp. 431-446.

15. W.Xu and S.Liu, “Soundness and completeness of the cirquent calculus system CL6 for computability logic”. Logic Journal of the IGPL 20 (2012), pp. 317-330.

16. W.Xu and S.Liu, “Cirquent calculus system CL8S versus calculus of structures system SKSg for propositional logic”. In: Quantitative Logic and Soft Computing. Guojun Wang, Bin Zhao and Yongming Li, eds. Singapore, World Scientific, 2012, pp. 144-149.

17. F.N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”. Matematicheskii Sbornik 203 (2012), pp. 141-160.

18. D. Fernández-Duque and J.J.Joosten, “Well-orders in the transfinite Japaridze algebra”. arXiv:1212.3468 (2012).

19. D. Fernández-Duque and J.J.Joosten, “Well-founded orders on the transfinite Japaridze algebra II”. arXiv:1204.4743 (2012)

20. W.Zhang, L.Zeng, H.Zhang and S.Li, “Collaboration in digital games: An approach to the description logic of tasks”. Journal of Computer Research and Development 49:7 (2012).

21. L.Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”. Proceedings of the Steklov Institute of Mathematics 274 (2011), pp. 25-33.

22. L.Beklemishev, “Ordinal completeness of bimodal provability logic GLB”. Lecture Notes in Computer Science 6618 (2011), pp. 1-15.

23. D.S.Shamkanov, “Interpolation properties for provability logics GL and GLP”. Proceedings of the Steklov Institute of Mathematics 274 (2011), pp. 303-316.

24. L.Min, Y.Liu and X.Chen, “Analysis of deterministic finite automata in computability logic”. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition) 23:6 (2011), pp. 80-82. 25. X.Ma, “On theorems in system CL4 of computability logic”. Journal of Xi’an Institute of Posts and Telecommunications 16:5 (2011), pp. 80- 82.

26. I.Mezhirov and N.Vereshchagin, “On abstract resource semantics and computability logic”. Journal of Computer and Systems Sciences 76 (2010), pp. 356-372.

27. L.Beklemishev, “ for provability logic GLP”. Annals of Pure and Applied Logic 161, 756–774 (2010).

28. L.Beklemishev, G. Bezhanishvili and T. Icar, “On topological models of GLP”. Ways of proof theory, Ontos Mathematical Logic, 2, eds. R. Schindler, Ontos Verlag, Frankfurt, 2010, pp. 133–153.

29. L.Beklemishev, “On the Craig interpolation and the fixed point properties of GLP”. In: Proofs, Categories and Computations. S. Feferman et al., eds., College Publications 2010. pp. 49-60.

30. W.Xu and S.Liu, “Deduction theorem for symmetric cirquent calculus”. Advances in Intelligent and Soft Computing 82 (2010), pp. 121-126.

31. W.Zhang, L.Zeng, H.Zhang and S.Li, “Task planning based on the description logic of tasks in joint operation scenarios”. Journal of Software 21 (2010), pp.140−148.

32. W.Xu and S.Liu, “Knowledge representation and reasoning rased on computability logic”. Journal of Jilin University 47 (2009), pp. 1230-1236.

33. L.Beklemishev, “On GLP-spaces”. Manusript, Steklov Institute of Mathematics, 2009.

34. I. Shapirovsky, "PSPACE- of Japaridze's polymodal logic". Advances in Modal Logic 7 (2008), pp. 289-304.

35. L.Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”. Proceedings of the Steklov Institute of Mathematics 274 (2011), pp. 25-33. 36. N.Vereshchagin, "Japaridze's computability logic and intuitionistic propositional calculus". Moscow State University preprint (Russian), 2006.

37. G.Wang and W.Xu, "Theorems in the logic of tasks". Fuzzy Systems and Mathematics 20（2006), No.6, pp. 15-20.

38. H.Zhang and S.Li, "The description logic of tasks: from theory to practice". Chinese Journal of Computers 29（2006), No.3, pp. 488-494.

39. L.D. Beklemishev, J.J. Joosten and M. Vervoort, "A finitary treatment of the closed fragment of Japaridze's provability logic". Journal of Logic and Computation 15 (2005), No 4, pp. 447-463.

40. W.Xu, "The logic of tasks". MS Thesis (Chinese). Shaanxi Normal University, 2004.

41. G.Wang and W.Xu, "From the logic of facts to the logic of tasks". Fuzzy Systems and Mathematics 18（2004), No.1, pp. 1-8.

42. G. Boolos, "The analytical completeness of Japaridze's polymodal logics". Annals of Pure and Applied Logic 61 (1993), pp. 95-111.

43. K. Ignatiev, "The closed fragment of Japaridze's polymodal logic and the logic of Sigma- 1 conservativity". ITLI Prepublication Series for Mathematical Logic and Foundations, X-92-02, University of Amsterdam, 1992.

44. K. Ignatiev, "Japaridze's polymodal logic: arithmetical completeness, fixed point property, Craig's property". ITLI Prepublication Series for Mathematical Logic and Foundations, X-90-13, University of Amsterdam, 1990.