Giorgi Japaridze

Giorgi Japaridze (Giorgie Dzhaparidze deb ham yoziladi) — gruzin-amerikalik olim, mantiq va nazariy informatika sohasi tadqiqotchisi.

Tegishli bibliografiya

• F. Pakhomov, "On the complexity of the closed fragment of Japaridze's provability logic". Archive for Mathematical Logic 53 (2014), pages 949-967.
• D. Fernandez-Duque and J. Joosten, "Well-orders in the transfinite Japaridze algebra". Logic Journal of the IGPL 22 (2014), pages 933-963. Preprint on J. Joosten’s website (2012), last revised version in 2014:arXiv:1212.3468v4.
• W. Xu, "A propositional system induced by Japaridze's approach to IF logic". Logic Journal of the IGPL 22 (2014), pages 982-991.
• I. Shapirovsky, "PSPACE-decidability of Japaridze's polymodal logic". Advances in Modal Logic 7 (2008), pages 289-304.
• 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(4) (2005), pages 447-463.
• G. Boolos, "The analytical completeness of Japaridze's polymodal logics". Annals of Pure and Applied Logic 61 (1993), pages 95–111.

Tanlangan nashrlar

• G. Japaridze, "Build your own clarithmetic I: Setup and completeness". Logical Methods in Computer Science 12 (2016), Issue 3, paper 8, pages 1–59.
• G. Japaridze, "Build your own clarithmetic II: Soundness". Logical Methods in Computer Science 12 (2016), Issue 3, paper 12, pages 1–62.
• G. Japaridze, "Introduction to clarithmetic II". Information and Computation 247 (2016), pages 290-312.
• G. Japaridze, "Introduction to clarithmetic III". Annals of Pure and Applied Logic 165 (2014), pages 241-252.
• G. Japaridze, "The taming of recurrences in computability logic through cirquent calculus, Part II". Archive for Mathematical Logic 52 (2013), pages 213-259.
• G. Japaridze, "The taming of recurrences in computability logic through cirquent calculus, Part I". Archive for Mathematical Logic 52 (2013), pages 173-212.
• G. Japaridze, "A new face of the branching recurrence of computability logic". Applied Mathematics Letters 25 (2012), pages 1585-1589.
• G. Japaridze, "A logical basis for constructive systems". Journal of Logic and Computation 22 (2012), pages 605-642.
• G. Japaridze, "Separating the basic logics of the basic recurrences". Annals of Pure and Applied Logic 163 (2012), pages 377-389.
• G. Japaridze, "Introduction to clarithmetic I". Information and Computation 209 (2011), pages 1312-1354.
• G. Japaridze, "From formulas to cirquents in computability logic". Logical Methods in Computer Science 7 (2011), Issue 2, Paper 1, pages 1–55.
• G. Japaridze, "Toggling operators in computability logic". Theoretical Computer Science 412 (2011), pages 971-1004.
• G. Japaridze, "Towards applied theories based on computability logic". Journal of Symbolic Logic 75 (2010), pages 565-601.
• G. Japaridze, "Many concepts and two logics of algorithmic reduction". Studia Logica 91 (2009), pages 1–24.
• 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, pages 249-350.
• G. Japaridze, "Sequential operators in computability logic". Information and Computation 206 (2008), pages 1443-1475.
• G. Japaridze, "Cirquent calculus deepened". Journal of Logic and Computation 18 (2008), pages 983-1028.
• G. Japaridze, "The intuitionistic fragment of computability logic at the propositional level". Annals of Pure and Applied Logic 147 (2007), pages 187-227.
• G. Japaridze, "The logic of interactive Turing reduction". Journal of Symbolic Logic 72 (2007), pages 243-276.
• G. Japaridze, "Intuitionistic computability logic (Wayback Machine saytida 2017-10-17 sanasida arxivlangan)". Acta Cybernetica 18 (2007), pages 77–113.
• G. Japaridze, "From truth to computability II". Theoretical Computer Science 379 (2007), pages 20–52.
• G. Japaridze, "From truth to computability I". Theoretical Computer Science 357 (2006), pages 100-135.
• G. Japaridze, "Introduction to cirquent calculus and abstract resource semantics". Journal of Logic and Computation 16 (2006), pages 489-532.
• 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, pages 183-223.
• G. Japaridze, "Propositional computability logic II". ACM Transactions on Computational Logic 7 (2006), pages 331-362.
• G. Japaridze, "Propositional computability logic I". ACM Transactions on Computational Logic 7 (2006), pages 302-330.
• G. Japaridze, "Introduction to computability logic". Annals of Pure and Applied Logic 123 (2003), pages 1–99.
• G. Japaridze, "The logic of tasks". Annals of Pure and Applied Logic 117 (2002), pages 261-293.
• G. Japaridze, "The propositional logic of elementary tasks". Notre Dame Journal of Formal Logic 41 (2000), No. 2, pages 171-183.
• G. Japaridze and D. DeJongh, "The logic of provability". In: Handbook of Proof Theory, S. Buss, ed., North-Holland, 1998, pages 475-545.
• G. Japaridze, "A constructive game semantics for the language of linear logic". Annals of Pure and Applied Logic 85 (1997), pages 87–156.
• G. Japaridze, "A simple proof of arithmetical completeness for Pi-1 conservativity logic". Notre Dame Journal of Formal Logic 35 (1994), pages 346-354.
• G. Japaridze, "The logic of arithmetical hierarchy". Annals of Pure and Applied Logic 66 (1994), pages 89–112.
• G. Japaridze, "A generalized notion of weak interpretability and the corresponding modal logic". Annals of Pure and Applied Logic 61 (1993), pages 113-160.
• G. Japaridze, "The logic of linear tolerance". Studia Logica 51 (1992), pages 249-277.
• G. Japaridze, "Predicate provability logic with non-modalized quantifiers". Studia Logica 50 (1991), pages 149-160.
• G. Japaridze, "Decidable and enumerable predicate logics of provability". Studia Logica 49 (1990), pages 7–21.
• S. Artemov va G. Japaridze, "Finite Kripke models and predicate logics of provability". Journal of Symbolic Logic 55 (1990), pages 1090-1098.
• G. Japaridze, "The polymodal logic of provability". Intensional Logics and Logical Structure of Theories. Metsniereba, Tbilisi, 1988, pages 16–48 (rus tilida).
• S. Artemov va G. Japaridze, "On effective predicate logics of provability". Dokady Mathematics 297 (1987), pages 521-523 (rus tilida). Inglizcha tarjimasi: Soviet Mathematics - Doklady 36, pages 478-480.

Tashqi havolalar

• Giorgi Japaridze's Homepage
• Villanova professor honored for research (Philadelphia Inquirer maqolasi)
• Villanova University Selects Computing Sciences Professor as Recipient of 2015 Outstanding Faculty Research Award (press-reliz)
• Computability Logic Homepage
• Game Semantics or Linear Logic?
• Lecture Course on Computability Logic
• On abstract resource semantics and computabilty logic (N. Vereshchagin videomaʼruzasi)