The Philosopher
Giorgi Japaridze
The face
The background
- Nationality:
- Georgian-American
The synopsis
The works
The polymodal logic of provability
Decidable and enumerable predicate logics of provability
Predicate provability logic with non-modalized quantifiers
A generalized notion of weak interpretability and the corresponding modal logic
The logic of arithmetical hierarchy
The logic of tasks
Introduction to computability logic
Propositional computability logic I
Propositional computability logic II
Computability logic: a formal theory of interaction
Introduction to cirquent calculus and abstract resource semantics
The intuitionistic fragment of computability logic at the propositional level
From truth to computability I
From truth to computability II
Intuitionistic computability logic
The logic of interactive Turing reduction
A logical basis for constructive systems
Separating the basic logics of the basic recurrences
From formulas to cirquents in computability logic
Toggling operators in computability logic
Towards applied theories based on computability logic
Many concepts and two logics of algorithmic reduction
In the beginning was game semantics
Sequential operators in computability logic
Cirquent calculus deepened
The taming of recurrences in computability logic through cirquent calculus, Part I
The taming of recurrences in computability logic through cirquent calculus, Part II
A new face of the branching recurrence of computability logic
Introduction to clarithmetic I
Introduction to clarithmetic III
Build your own clarithmetic I: Setup and completeness
Build your own clarithmetic II: Soundness
Introduction to clarithmetic II
The propositional logic of elementary tasks
The logic of provability
A constructive game semantics for the language of linear logic
A simple proof of arithmetical completeness for Pi-1 conservativity logic
The logic of linear tolerance