58 citations · 597 across the 38 of their papers we have counts for
4 papers · 1 filter
The logic of interactive Turing reduction
Giorgi Japaridze
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands i…
In the beginning was game semantics
Giorgi Japaridze
This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview…
Introduction to Cirquent Calculus and Abstract Resource Semantics
Giorgi Japaridze
This paper introduces a refinement of the sequent calculus approach called cirquent calculus. While in Gentzen-style proof trees sibling (or cousin, etc.) sequents are disjoint seq…
From truth to computability II
Giorgi Japaridze
Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and "truth" is understood as algorithmic s…