58 citations · 597 across the 38 of their papers we have counts for
5 papers · 1 filter
Intuitionistic computability logic
Giorgi Japaridze
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically i…
From truth to computability I
Giorgi Japaridze
The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.e…
Propositional Computability Logic II
Giorgi Japaridze
Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on co…
Computability Logic: a formal theory of interaction
Giorgi Japaridze
Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in…
Propositional computability logic I
Giorgi Japaridze
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (in…