Finite Kripke Models and Predicate Logics of Provability. - Sergei N. Artëmov; Giorgie Dzhaparidze (J. Symb. Log., 1990)

Decidable and enumerable predicate logics of provability. - Giorgie Dzhaparidze (Stud Logica, 1990)

Predicate provability logic with non-modalized quantifiers. - Giorgie Dzhaparidze (Stud Logica, 1991)

A Generalized Notion of Weak Interpretability and the Corresponding Modal Logic. - Giorgie Dzhaparidze (Ann. Pure Appl. Log., 1993)

The Logic of Arithmetical Hierarchy. - Giorgie Dzhaparidze (Ann. Pure Appl. Log., 1994)

A Simple Proof of Arithmetical Completeness for Π1-conservativity Logic. - Giorgi Japaridze (Notre Dame J. Formal Log., 1994)

A Constructive Game Semantics for the Language of Linear Logic. - Giorgi Japaridze (Ann. Pure Appl. Log., 1997)

The Propositional Logic of Elementary Tasks. - Giorgi Japaridze (Notre Dame J. Formal Log., 2000)

The logic of tasks. - Giorgi Japaridze (Ann. Pure Appl. Log., 2002)

Introduction to computability logic. - Giorgi Japaridze (Ann. Pure Appl. Log., 2003)

Computability Logic: a formal theory of interaction - Giorgi Japaridze (CoRR, 2004)

Intuitionistic computability logic I - Giorgi Japaridze (CoRR, 2004)

In the beginning was game semantics - Giorgi Japaridze (CoRR, 2005)

Introduction to Cirquent Calculus and Abstract Resource Semantics. - Giorgi Japaridze (J. Log. Comput., 2006)

From truth to computability I. - Giorgi Japaridze (Theor. Comput. Sci., 2006)

Propositional computability logic I. - Giorgi Japaridze (ACM Trans. Comput. Log., 2006)

Propositional computability logic II. - Giorgi Japaridze (ACM Trans. Comput. Log., 2006)

Intuitionistic computability logic. - Giorgi Japaridze (Acta Cybern., 2007)

The intuitionistic fragment of computability logic at the propositional level. - Giorgi Japaridze (Ann. Pure Appl. Log., 2007)

Four concepts and two logics of algorithmic reduction - Giorgi Japaridze (CoRR, 2007)

The logic of interactive Turing reduction. - Giorgi Japaridze (J. Symb. Log., 2007)

From truth to computability II. - Giorgi Japaridze (Theor. Comput. Sci., 2007)

Sequential operators in computability logic. - Giorgi Japaridze (Inf. Comput., 2008)

Cirquent Calculus Deepened. - Giorgi Japaridze (J. Log. Comput., 2008)

Ptarithmetic - Giorgi Japaridze (CoRR, 2009)

Many Concepts and Two Logics of Algorithmic Reduction. - Giorgi Japaridze (Stud Logica, 2009)

In the Beginning was Game Semantics? - Giorgi Japaridze (Games: Unifying Logic, Language, and Philosophy, 2009)

Towards applied theories based on computability logic. - Giorgi Japaridze (J. Symb. Log., 2010)

From formulas to cirquents in computability logic - Giorgi Japaridze (Log. Methods Comput. Sci., 2011)

The taming of recurrences in computability logic through cirquent calculus - Giorgi Japaridze (CoRR, 2011)

Introduction to clarithmetic I. - Giorgi Japaridze (Inf. Comput., 2011)

Toggling operators in computability logic. - Giorgi Japaridze (Theor. Comput. Sci., 2011)

Separating the basic logics of the basic recurrences. - Giorgi Japaridze (Ann. Pure Appl. Log., 2012)

A new face of the branching recurrence of computability logic. - Giorgi Japaridze (Appl. Math. Lett., 2012)

A logical basis for constructive systems. - Giorgi Japaridze (J. Log. Comput., 2012)

The taming of recurrences in computability logic through cirquent calculus, Part I. - Giorgi Japaridze (Arch. Math. Log., 2013)

The taming of recurrences in computability logic through cirquent calculus, Part II. - Giorgi Japaridze (Arch. Math. Log., 2013)

On resources and tasks. - Giorgi Japaridze (CoRR, 2013)

Introduction to clarithmetic III. - Giorgi Japaridze (Ann. Pure Appl. Log., 2014)

On the system CL12 of computability logic - Giorgi Japaridze (Log. Methods Comput. Sci., 2015)

Build your own clarithmetic I. - Giorgi Japaridze (Log. Methods Comput. Sci., 2016)

Build your own clarithmetic II. - Giorgi Japaridze (Log. Methods Comput. Sci., 2016)

A survey of computability logic. - Giorgi Japaridze (CoRR, 2016)

Introduction to clarithmetic II. - Giorgi Japaridze (Inf. Comput., 2016)

Elementary-base Cirquent Calculus I: Parallel and Choice Connectives. - Giorgi Japaridze (FLAP, 2018)

Computability logic: Giving Caesar what belongs to Caesar. - Giorgi Japaridze (CoRR, 2019)

Fundamentals of Computability Logic. - Giorgi Japaridze (FLAP, 2020)

Cirquent calculus in a nutshell. - Giorgi Japaridze; Bikal Lamichhane (CoRR, 2021)

Elementary-base cirquent calculus II: Choice quantifiers. - Giorgi Japaridze (Log. J. IGPL, 2021)

Thoughts on sub-Turing interactive computability. - Giorgi Japaridze (CoRR, 2024)

A Propositional Cirquent Calculus for Computability Logic. - Giorgi Japaridze (J. Log. Lang. Inf., 2024)