58 citations · 597 across the 38 of their papers we have counts for
40 papers
Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
Giorgi Japaridze
Computability logic (CoL) provides a semantic foundation in which formulas represent interactive computational problems and validity corresponds to uniform algorithmic solvability.…
Thoughts on sub-Turing interactive computability
Giorgi Japaridze
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or…
A propositional cirquent calculus for computability logic
Giorgi Japaridze
Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in logical expressions. Within its framework, this article constructs an axiomatizati…
Cirquent calculus in a nutshell
Giorgi Japaridze, Bikal Lamichhane
This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mecha…
Fundamentals of computability logic 2020
Giorgi Japaridze
This article is a semitutorial-style survey of computability logic. An extended online version of it is maintained at http://www.csc.villanova.edu/~japaridz/CL/ .
Elementary-base cirquent calculus II: Choice quantifiers
Giorgi Japaridze
Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel…