Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Japaridze, Giorgi
2007.
The intuitionistic fragment of computability logic at the propositional level.
Annals of Pure and Applied Logic,
Vol. 147,
Issue. 3,
p.
187.
Japaridze, Giorgi
2008.
Sequential operators in computability logic.
Information and Computation,
Vol. 206,
Issue. 12,
p.
1443.
Japaridze, Giorgi
2009.
Games: Unifying Logic, Language, and Philosophy.
Vol. 15,
Issue. ,
p.
249.
Japaridze, Giorgi
2009.
Many Concepts and Two Logics of Algorithmic Reduction.
Studia Logica,
Vol. 91,
Issue. 1,
p.
1.
Japaridze, Giorgi
2011.
Toggling operators in computability logic.
Theoretical Computer Science,
Vol. 412,
Issue. 11,
p.
971.
Japaridze, Giorgi
2011.
Introduction to clarithmetic I.
Information and Computation,
Vol. 209,
Issue. 10,
p.
1312.
Japaridze, Giorgi
2011.
From formulas to cirquents in computability logic.
Logical Methods in Computer Science,
Vol. Volume 7, Issue 2,
Issue. ,
Japaridze, G.
2012.
A logical basis for constructive systems.
Journal of Logic and Computation,
Vol. 22,
Issue. 3,
p.
605.
Japaridze, Giorgi
2012.
A new face of the branching recurrence of computability logic.
Applied Mathematics Letters,
Vol. 25,
Issue. 11,
p.
1585.
Japaridze, Giorgi
2012.
Separating the basic logics of the basic recurrences.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 3,
p.
377.
Japaridze, Giorgi
2013.
The taming of recurrences in computability logic through cirquent calculus, Part II.
Archive for Mathematical Logic,
Vol. 52,
Issue. 1-2,
p.
213.
Xu, Wenyan
and
Liu, Sanyang
2013.
The Parallel versus Branching Recurrences in Computability Logic.
Notre Dame Journal of Formal Logic,
Vol. 54,
Issue. 1,
Japaridze, Giorgi
2013.
The taming of recurrences in computability logic through cirquent calculus, Part I.
Archive for Mathematical Logic,
Vol. 52,
Issue. 1-2,
p.
173.
Japaridze, Giorgi
2016.
Introduction to clarithmetic II.
Information and Computation,
Vol. 247,
Issue. ,
p.
290.