Giorgi Japaridze

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 13

Top Topics

Computer Algebra

Natural Deduction

Abductive Reasoning

Top Venues

Log. Methods Comput. Sci.

Publications

Giorgi Japaridze
A propositional cirquent calculus for computability logic. CoRR (2024)
Giorgi Japaridze, Bikal Lamichhane
Cirquent calculus in a nutshell. CoRR (2021)
Giorgi Japaridze
Elementary-base cirquent calculus II: Choice quantifiers. Log. J. IGPL 29 (5) (2021)
Giorgi Japaridze
Fundamentals of Computability Logic. FLAP 7 (6) (2020)
Giorgi Japaridze
Computability logic: Giving Caesar what belongs to Caesar. CoRR (2019)
Giorgi Japaridze
Fundamentals of computability logic. CoRR (2019)
Giorgi Japaridze
Elementary-base cirquent calculus II: Choice quantifiers. CoRR (2019)
Giorgi Japaridze
Elementary-base Cirquent Calculus I: Parallel and Choice Connectives. FLAP 5 (1) (2018)
Giorgi Japaridze
Elementary-base cirquent calculus I: Parallel and choice connectives. CoRR (2017)
Giorgi Japaridze
Build your own clarithmetic II. Log. Methods Comput. Sci. 12 (3) (2016)
Giorgi Japaridze
A survey of computability logic. CoRR (2016)
Giorgi Japaridze
Build your own clarithmetic I. Log. Methods Comput. Sci. 12 (3) (2016)
Giorgi Japaridze
Introduction to clarithmetic II. Inf. Comput. 247 (2016)
Giorgi Japaridze
On the system CL12 of computability logic Log. Methods Comput. Sci. 11 (3) (2015)
Giorgi Japaridze
Introduction to clarithmetic III. Ann. Pure Appl. Log. 165 (1) (2014)
Giorgi Japaridze
On resources and tasks. CoRR (2013)
Giorgi Japaridze
The taming of recurrences in computability logic through cirquent calculus, Part I. Arch. Math. Log. 52 (1-2) (2013)
Giorgi Japaridze
The taming of recurrences in computability logic through cirquent calculus, Part II. Arch. Math. Log. 52 (1-2) (2013)
Giorgi Japaridze
A new face of the branching recurrence of computability logic. Appl. Math. Lett. 25 (11) (2012)
Giorgi Japaridze
Separating the basic logics of the basic recurrences. Ann. Pure Appl. Log. 163 (3) (2012)
Giorgi Japaridze
A logical basis for constructive systems. J. Log. Comput. 22 (3) (2012)
Giorgi Japaridze
The taming of recurrences in computability logic through cirquent calculus CoRR (2011)
Giorgi Japaridze
The taming of recurrences in computability logic through cirquent calculus, Part II CoRR (2011)
Giorgi Japaridze
From formulas to cirquents in computability logic Log. Methods Comput. Sci. 7 (2) (2011)
Giorgi Japaridze
A new face of the branching recurrence of computability logic CoRR (2011)
Giorgi Japaridze
Introduction to clarithmetic I. Inf. Comput. 209 (10) (2011)
Giorgi Japaridze
Toggling operators in computability logic. Theor. Comput. Sci. 412 (11) (2011)
Giorgi Japaridze
Introduction to clarithmetic III CoRR (2010)
Giorgi Japaridze
A logical basis for constructive systems CoRR (2010)
Giorgi Japaridze
Introduction to clarithmetic I CoRR (2010)
Giorgi Japaridze
Towards applied theories based on computability logic. J. Symb. Log. 75 (2) (2010)
Giorgi Japaridze
Introduction to clarithmetic II CoRR (2010)
Giorgi Japaridze
Separating the basic logics of the basic recurrences CoRR (2010)
Giorgi Japaridze
Toggling operators in computability logic CoRR (2009)
Giorgi Japaridze
Ptarithmetic CoRR (2009)
Giorgi Japaridze
Many Concepts and Two Logics of Algorithmic Reduction. Stud Logica 91 (1) (2009)
Giorgi Japaridze
Sequential operators in computability logic. Inf. Comput. 206 (12) (2008)
Giorgi Japaridze
Towards applied theories based on computability logic CoRR (2008)
Giorgi Japaridze
Cirquent Calculus Deepened. J. Log. Comput. 18 (6) (2008)
Giorgi Japaridze
The intuitionistic fragment of computability logic at the propositional level. Ann. Pure Appl. Log. 147 (3) (2007)
Giorgi Japaridze
Four concepts and two logics of algorithmic reduction CoRR (2007)
Giorgi Japaridze
The logic of interactive Turing reduction. J. Symb. Log. 72 (1) (2007)
Giorgi Japaridze
Sequential operators in computability logic CoRR (2007)
Giorgi Japaridze
Intuitionistic computability logic. Acta Cybern. 18 (1) (2007)
Giorgi Japaridze
From truth to computability II. Theor. Comput. Sci. 379 (1-2) (2007)
Giorgi Japaridze
Cirquent calculus deepened CoRR (2007)
Giorgi Japaridze
From truth to computability I. Theor. Comput. Sci. 357 (1-3) (2006)
Giorgi Japaridze
Introduction to Cirquent Calculus and Abstract Resource Semantics. J. Log. Comput. 16 (4) (2006)
Giorgi Japaridze
Propositional computability logic II. ACM Trans. Comput. Log. 7 (2) (2006)
Giorgi Japaridze
The intuitionistic fragment of computability logic at the propositional level CoRR (2006)
Giorgi Japaridze
Propositional computability logic I. ACM Trans. Comput. Log. 7 (2) (2006)
Giorgi Japaridze
In the beginning was game semantics CoRR (2005)
Giorgi Japaridze
Introduction to Cirquent Calculus and Abstract Resource Semantics. CoRR (2005)
Giorgi Japaridze
The logic of interactive Turing reduction CoRR (2005)
Giorgi Japaridze
From truth to computability II CoRR (2005)
Giorgi Japaridze
Intuitionistic computability logic I CoRR (2004)
Giorgi Japaridze
From truth to computability I CoRR (2004)
Giorgi Japaridze
Propositional computability logic I CoRR (2004)
Giorgi Japaridze
Propositional Computability Logic II CoRR (2004)
Giorgi Japaridze
Computability Logic: a formal theory of interaction CoRR (2004)
Giorgi Japaridze
Introduction to computability logic. Ann. Pure Appl. Log. 123 (1-3) (2003)
Giorgi Japaridze
The logic of tasks. Ann. Pure Appl. Log. 117 (1-3) (2002)
Giorgi Japaridze
The Propositional Logic of Elementary Tasks. Notre Dame J. Formal Log. 41 (2) (2000)
Giorgi Japaridze
A Constructive Game Semantics for the Language of Linear Logic. Ann. Pure Appl. Log. 85 (2) (1997)
Giorgi Japaridze
-conservativity Logic. Notre Dame J. Formal Log. 35 (3) (1994)