Giorgi Japaridze

From MaRDI portal
Person:259083

Available identifiers

zbMath Open japaridze.giorgiMaRDI QIDQ259083

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58831842023-03-29Paper
Cirquent Calculus in a Nutshell2023-01-16Paper
https://portal.mardi4nfdi.de/entity/Q58695262022-09-28Paper
https://portal.mardi4nfdi.de/entity/Q58697222022-09-28Paper
Elementary-base cirquent calculus II: Choice quantifiers2021-12-03Paper
Cirquent calculus in a nutshell2021-08-27Paper
Computability logic: Giving Caesar what belongs to Caesar2020-09-17Paper
Arithmetics based on computability logic2020-03-06Paper
Elementary-base cirquent calculus I: Parallel and choice connectives2017-07-16Paper
Propositional computability logic I2017-07-12Paper
Propositional computability logic II2017-07-12Paper
Build your own clarithmetic I: Setup and completeness2017-04-11Paper
Build your own clarithmetic II: Soundness2017-04-11Paper
Introduction to clarithmetic. II2016-03-10Paper
On the system CL12 of computability logic2015-08-25Paper
Introduction to clarithmetic. III2014-01-13Paper
Computability Logic: A Formal Theory of Interaction2013-06-18Paper
The taming of recurrences in computability logic through cirquent calculus. II2013-02-15Paper
The taming of recurrences in computability logic through cirquent calculus. I2013-02-15Paper
A new face of the branching recurrence of computability logic2012-10-17Paper
A logical basis for constructive systems2012-06-20Paper
Separating the basic logics of the basic recurrences2012-04-13Paper
Introduction to clarithmetic. I2011-10-27Paper
From formulas to cirquents in computability logic2011-05-26Paper
Toggling operators in computability logic2011-03-14Paper
Towards applied theories based on computability logic2010-06-24Paper
In the beginning was game semantics2009-04-14Paper
Many concepts and two logics of algorithmic reduction2009-03-17Paper
Sequential operators in computability logic2009-02-03Paper
Cirquent Calculus Deepened2008-12-22Paper
Intuitionistic computability logic2007-10-26Paper
The intuitionistic fragment of computability logic at the propositional level2007-07-16Paper
From truth to computability. II.2007-07-16Paper
The logic of interactive turing reduction2007-03-12Paper
Introduction to Cirquent Calculus and Abstract Resource Semantics2006-12-04Paper
From truth to computability. I.2006-08-16Paper
Introduction to computability logic2003-09-25Paper
The propositional logic of elementary tasks2003-07-31Paper
The logic of tasks2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43308572002-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42156361999-07-05Paper
A constructive game semantics for the language of linear logic1998-02-04Paper
A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic1995-07-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Giorgi Japaridze