3 papers
cs.LO2026
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.…
cs.LO2024
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…
cs.LO2024
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…