The following pages link to Giorgi Japaridze (Q259083):
Displayed 43 items.
- Introduction to clarithmetic. II (Q259084) (← links)
- Introduction to clarithmetic. III (Q392285) (← links)
- Separating the basic logics of the basic recurrences (Q409329) (← links)
- Toggling operators in computability logic (Q631756) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Sequential operators in computability logic (Q999265) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- A constructive game semantics for the language of linear logic (Q1361252) (← links)
- Introduction to computability logic (Q1408853) (← links)
- The logic of tasks (Q1849860) (← links)
- The propositional logic of elementary tasks (Q1861137) (← links)
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic (Q1893136) (← links)
- The taming of recurrences in computability logic through cirquent calculus. II (Q1935368) (← links)
- The taming of recurrences in computability logic through cirquent calculus. I (Q1935369) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- From truth to computability. II. (Q2373705) (← links)
- From truth to computability. I. (Q2500484) (← links)
- A logical basis for constructive systems (Q2893325) (← links)
- On the system CL12 of computability logic (Q2941766) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Build your own clarithmetic II: Soundness (Q2974783) (← links)
- From formulas to cirquents in computability logic (Q3003318) (← links)
- Introduction to Cirquent Calculus and Abstract Resource Semantics (Q3412001) (← links)
- The logic of interactive turing reduction (Q3426573) (← links)
- Cirquent Calculus Deepened (Q3549318) (← links)
- Towards applied theories based on computability logic (Q3570163) (← links)
- In the beginning was game semantics (Q3620031) (← links)
- (Q4215636) (← links)
- (Q4330857) (← links)
- Computability Logic: A Formal Theory of Interaction (Q4928705) (← links)
- Elementary-base cirquent calculus II: Choice quantifiers (Q5014061) (← links)
- Cirquent Calculus in a Nutshell (Q5059715) (← links)
- Computability logic: Giving Caesar what belongs to Caesar (Q5124221) (← links)
- Arithmetics based on computability logic (Q5219132) (← links)
- Propositional computability logic I (Q5277750) (← links)
- Propositional computability logic II (Q5277751) (← links)
- Intuitionistic computability logic (Q5422557) (← links)
- (Q5869526) (← links)
- (Q5869722) (← links)
- (Q5883184) (← links)
- Elementary-base cirquent calculus I: Parallel and choice connectives (Q6289047) (← links)
- Cirquent calculus in a nutshell (Q6376195) (← links)