Giorgi Japaridze 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 Logic 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 (Georgia, former USSR) Thesis: The Notion of Truth 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 logics (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 semantics and the theory of interactive computation (1997-present) Introduced the Logic of Tasks (2000-2002). It later became a part of computability logic on one hand, and a part of abstract game semantics 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 intuitionistic logic 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 inference (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 Mathematical Logic 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,