We stand with Ukraine  

Giorgi Japaridze

Orcid: 0000-0002-7514-4282

Affiliations:
  • Villanova University, PA, USA


According to our database1, Giorgi Japaridze authored at least 49 papers between 1990 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Elementary-base cirquent calculus II: Choice quantifiers.
[BibTeX]
[DOI]
Giorgi Japaridze
Log. J. IGPL, 2021

Cirquent calculus in a nutshell.
[BibTeX]
[DOI]
Giorgi Japaridze
,
Bikal Lamichhane
CoRR, 2021

2020
Fundamentals of Computability Logic.
[BibTeX]
[DOI]
Giorgi Japaridze
FLAP, 2020

2019
Computability logic: Giving Caesar what belongs to Caesar.
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2019

2018
Elementary-base Cirquent Calculus I: Parallel and Choice Connectives.
[BibTeX]
[DOI]
Giorgi Japaridze
FLAP, 2018

2016
Introduction to clarithmetic II.
[BibTeX]
[DOI]
Giorgi Japaridze
Inf. Comput., 2016

A survey of computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2016

Build your own clarithmetic II.
[BibTeX]
[DOI]
Giorgi Japaridze
Log. Methods Comput. Sci., 2016

Build your own clarithmetic I.
[BibTeX]
[DOI]
Giorgi Japaridze
Log. Methods Comput. Sci., 2016

2015
On the system CL12 of computability logic
[BibTeX]
[DOI]
Giorgi Japaridze
Log. Methods Comput. Sci., 2015

2014
Introduction to clarithmetic III.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 2014

2013
On resources and tasks.
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2013

The taming of recurrences in computability logic through cirquent calculus, Part II.
[BibTeX]
[DOI]
Giorgi Japaridze
Arch. Math. Log., 2013

The taming of recurrences in computability logic through cirquent calculus, Part I.
[BibTeX]
[DOI]
Giorgi Japaridze
Arch. Math. Log., 2013

2012
A logical basis for constructive systems.
[BibTeX]
[DOI]
Giorgi Japaridze
J. Log. Comput., 2012

A new face of the branching recurrence of computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Appl. Math. Lett., 2012

Separating the basic logics of the basic recurrences.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 2012

2011
Toggling operators in computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Theor. Comput. Sci., 2011

Introduction to clarithmetic I.
[BibTeX]
[DOI]
Giorgi Japaridze
Inf. Comput., 2011

The taming of recurrences in computability logic through cirquent calculus
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2011

From formulas to cirquents in computability logic
[BibTeX]
[DOI]
Giorgi Japaridze
Log. Methods Comput. Sci., 2011

2010
Towards applied theories based on computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
J. Symb. Log., 2010

2009
In the Beginning was Game Semantics?
[BibTeX]
[DOI]
Giorgi Japaridze
Proceedings of the Games: Unifying Logic, Language, and Philosophy, 2009

Many Concepts and Two Logics of Algorithmic Reduction.
[BibTeX]
[DOI]
Giorgi Japaridze
Stud Logica, 2009

Ptarithmetic
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2009

2008
Cirquent Calculus Deepened.
[BibTeX]
[DOI]
Giorgi Japaridze
J. Log. Comput., 2008

Sequential operators in computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Inf. Comput., 2008

2007
From truth to computability II.
[BibTeX]
[DOI]
Giorgi Japaridze
Theor. Comput. Sci., 2007

The logic of interactive Turing reduction.
[BibTeX]
[DOI]
Giorgi Japaridze
J. Symb. Log., 2007

Four concepts and two logics of algorithmic reduction
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2007

The intuitionistic fragment of computability logic at the propositional level.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 2007

Intuitionistic computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Acta Cybern., 2007

2006
Propositional computability logic II.
[BibTeX]
[DOI]
Giorgi Japaridze
ACM Trans. Comput. Log., 2006

Propositional computability logic I.
[BibTeX]
[DOI]
Giorgi Japaridze
ACM Trans. Comput. Log., 2006

From truth to computability I.
[BibTeX]
[DOI]
Giorgi Japaridze
Theor. Comput. Sci., 2006

Introduction to Cirquent Calculus and Abstract Resource Semantics.
[BibTeX]
[DOI]
Giorgi Japaridze
J. Log. Comput., 2006

2005
In the beginning was game semantics
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2005

2004
Intuitionistic computability logic I
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2004

Computability Logic: a formal theory of interaction
[BibTeX]
[DOI]
Giorgi Japaridze
CoRR, 2004

2003
Introduction to computability logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 2003

2002
The logic of tasks.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 2002

2000
The Propositional Logic of Elementary Tasks.
[BibTeX]
[DOI]
Giorgi Japaridze
Notre Dame J. Formal Log., 2000

1997
A Constructive Game Semantics for the Language of Linear Logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Ann. Pure Appl. Log., 1997

1994
A Simple Proof of Arithmetical Completeness for Π<sub>1</sub>-conservativity Logic.
[BibTeX]
[DOI]
Giorgi Japaridze
Notre Dame J. Formal Log., 1994

The Logic of Arithmetical Hierarchy.
[BibTeX]
[DOI]
Giorgie Dzhaparidze
Ann. Pure Appl. Log., 1994

1993
A Generalized Notion of Weak Interpretability and the Corresponding Modal Logic.
[BibTeX]
[DOI]
Giorgie Dzhaparidze
Ann. Pure Appl. Log., 1993

1991
Predicate provability logic with non-modalized quantifiers.
[BibTeX]
[DOI]
Giorgie Dzhaparidze
Stud Logica, 1991

1990
Decidable and enumerable predicate logics of provability.
[BibTeX]
[DOI]
Giorgie Dzhaparidze
Stud Logica, 1990

Finite Kripke Models and Predicate Logics of Provability.
[BibTeX]
[DOI]
Sergei N. Artëmov
,
Giorgie Dzhaparidze
J. Symb. Log., 1990


  Loading...