Giorgi Japaridze (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Giorgi Japaridze" in English language version.

refsWebsite

Global rank English rank

12sciencedirect.com

149^th place

178^th place

7springer.com

274^th place

309^th place

6web.archive.org

1^st place

5villanova.edu

low place

8,527^th place

1aiml.net

low place

1lmcs-online.org

low place

1oxfordjournals.org

1,389^th place

2,996^th place

1u-szeged.hu

low place

1arxiv.org

69^th place

59^th place

1projecteuclid.org

3,707^th place

2,409^th place

1philly.com

664^th place

398^th place

aiml.net

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

arxiv.org

G. Japaridze, "On the system CL12 of computability logic". Logical Methods is Computer Science (in press).

lmcs-online.org

G. Japaridze, "From formulas to cirquents in computability logic". Logical Methods is Computer Science 7 (2011), Issue 2, Paper 1, pages 1-55.

oxfordjournals.org

jigpal.oxfordjournals.org

W. Xu, "A propositional system induced by Japaridze's approach to IF logic^{[dead link‍]}". Logic Journal of the IGPL 22 (2014), pages 982-991.

philly.com

Villanova professor honored for research (Philadelphia Inquirer article)

projecteuclid.org

G. Japaridze, "Towards applied theories based on computability logic Archived 2015-06-29 at the Wayback Machine". Journal of Symbolic Logic 75 (2010), pages 565-601.

sciencedirect.com

G. Boolos, "The analytical completeness of Japaridze's polymodal logics". Annals of Pure and Applied Logic 61 (1993), pages 95-111.
L. Beklemishev, "Provability algebras and proof-theoretic ordinals, I". Annals of Pure and Applied Logic 128 (2004), pages 103-123.
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, "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 arithmetical hierarchy". Annals of Pure and Applied Logic 66 (1994), pages 89-112.
G. Japaridze, "The logic of tasks". Annals of Pure and Applied Logic 117 (2002), pages 261-293.
I. Mezhirov and N. Vereshchagin, "On abstract resource semantics and computability logic". Journal of Computer and Systems Sciences 76 (2010), pages 356-372.
G. Japaridze, "Introduction to clarithmetic I". Information and Computation 209 (2011), pages 1312-1354.
I. Mezhirov and N. Vereshchagin, "On abstract resource semantics and computability logic". Journal of Computer and Systems Sciences 76 (2010), pages 356-372.
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, "Introduction to clarithmetic I". Information and Computation 209 (2011), pages 1312-1354.
G. Japaridze, "Introduction to clarithmetic III". Annals of Pure and Applied Logic 165 (2014), pages 241-252.

springer.com

link.springer.com

F. Pakhomov, "On the complexity of the closed fragment of Japaridze's provability logic". Archive for Mathematical Logic 53 (2014), pages 949-967.
G. Japaridze, "Decidable and enumerable predicate logics of provability". Studia Logica 49 (1990), pages 7-21.
G. Japaridze, "Predicate provability logic with non-modalized quantifiers". Studia Logica 50 (1991), pages 149-160.
G. Japaridze, "The logic of linear tolerance". Studia Logica 51 (1992), pages 249-277.
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, "The taming of recurrences in computability logic through cirquent calculus, Part II". Archive for Mathematical Logic 52 (2013), pages 213-259.
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.

u-szeged.hu

inf.u-szeged.hu

G. Japaridze, "Intuitionistic computability logic Archived 2017-10-17 at the Wayback Machine". Acta Cybernetica 18 (2007), pages 77-113.

villanova.edu

csc.villanova.edu

"Faculty : Villanova Dept of Computing Sciences". Archived from the original on 2005-10-30. Retrieved 2015-06-26.
G. Japaridze, "The polymodal logic of provability". Intensional Logics and Logical Structure of Theories. Metsniereba, Tbilisi, 1988, pages 16-48 (Russian).
G. Japaridze, "The polymodal logic of provability". Intensional Logics and Logical Structure of Theories. Metsniereba, Tbilisi, 1988, pages 16-48 (Russian).
[1] Giorgi Japaridze's Homepage
Giorgi Japaridze: Research and Publications

web.archive.org

"Faculty : Villanova Dept of Computing Sciences". Archived from the original on 2005-10-30. Retrieved 2015-06-26.
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. Japaridze, "Introduction to cirquent calculus and abstract resource semantics". Journal of Logic and Computation 16 (2006), pages 489-532.
G. Japaridze, "Introduction to cirquent calculus and abstract resource semantics". Journal of Logic and Computation 16 (2006), pages 489-532.
G. Japaridze, "Intuitionistic computability logic Archived 2017-10-17 at the Wayback Machine". Acta Cybernetica 18 (2007), pages 77-113.
G. Japaridze, "Towards applied theories based on computability logic Archived 2015-06-29 at the Wayback Machine". Journal of Symbolic Logic 75 (2010), pages 565-601.