| Publication | Date of Publication | Type |
|---|
A propositional cirquent calculus for computability logic.
Journal of Logic, Language and Information | 2025-01-13 | Paper |
scientific article; zbMATH DE number 7669414 (Why is no real title available?)
| 2023-03-29 | Paper |
Cirquent Calculus in a Nutshell
Logical Investigations | 2023-01-16 | Paper |
scientific article; zbMATH DE number 7594103 (Why is no real title available?)
| 2022-09-28 | Paper |
scientific article; zbMATH DE number 7594254 (Why is no real title available?)
| 2022-09-28 | Paper |
Elementary-base cirquent calculus. II: Choice quantifiers
Logic Journal of the IGPL | 2021-12-03 | Paper |
Cirquent calculus in a nutshell
| 2021-08-27 | Paper |
Computability logic: giving Caesar what belongs to Caesar
Logical Investigations | 2020-09-17 | Paper |
Arithmetics base on computability logic
Logical Investigations | 2020-03-06 | Paper |
Elementary-base cirquent calculus I: Parallel and choice connectives
| 2017-07-16 | Paper |
Propositional computability logic I
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Propositional computability logic II
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Build your own clarithmetic. I: Setup and completeness
Logical Methods in Computer Science | 2017-04-11 | Paper |
Build your own clarithmetic. II: Soundness
Logical Methods in Computer Science | 2017-04-11 | Paper |
Introduction to clarithmetic. II
Information and Computation | 2016-03-10 | Paper |
On the system CL12 of computability logic
Logical Methods in Computer Science | 2015-08-25 | Paper |
Introduction to clarithmetic. III
Annals of Pure and Applied Logic | 2014-01-13 | Paper |
Computability logic: a formal theory of interaction
Interactive Computation | 2013-06-18 | Paper |
The taming of recurrences in computability logic through cirquent calculus. II
Archive for Mathematical Logic | 2013-02-15 | Paper |
The taming of recurrences in computability logic through cirquent calculus. I
Archive for Mathematical Logic | 2013-02-15 | Paper |
A new face of the branching recurrence of computability logic
Applied Mathematics Letters | 2012-10-17 | Paper |
A logical basis for constructive systems
Journal of Logic and Computation | 2012-06-20 | Paper |
Separating the basic logics of the basic recurrences
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
Introduction to clarithmetic. I
Information and Computation | 2011-10-27 | Paper |
From formulas to cirquents in computability logic
Logical Methods in Computer Science | 2011-05-26 | Paper |
Toggling operators in computability logic
Theoretical Computer Science | 2011-03-14 | Paper |
Towards applied theories based on computability logic
Journal of Symbolic Logic | 2010-06-24 | Paper |
In the beginning was game semantics
| 2009-04-14 | Paper |
Many concepts and two logics of algorithmic reduction
Studia Logica | 2009-03-17 | Paper |
Sequential operators in computability logic
Information and Computation | 2009-02-03 | Paper |
Cirquent Calculus Deepened
Journal Of Logic And Computation | 2008-12-22 | Paper |
Intuitionistic computability logic
| 2007-10-26 | Paper |
The intuitionistic fragment of computability logic at the propositional level
Annals of Pure and Applied Logic | 2007-07-16 | Paper |
From truth to computability. II.
Theoretical Computer Science | 2007-07-16 | Paper |
The logic of interactive turing reduction
Journal of Symbolic Logic | 2007-03-12 | Paper |
Introduction to Cirquent Calculus and Abstract Resource Semantics
Journal Of Logic And Computation | 2006-12-04 | Paper |
From truth to computability. I.
Theoretical Computer Science | 2006-08-16 | Paper |
Introduction to computability logic
Annals of Pure and Applied Logic | 2003-09-25 | Paper |
The propositional logic of elementary tasks
Notre Dame Journal of Formal Logic | 2003-07-31 | Paper |
The logic of tasks
Annals of Pure and Applied Logic | 2002-12-02 | Paper |
scientific article; zbMATH DE number 1740317 (Why is no real title available?)
| 2002-05-14 | Paper |
scientific article; zbMATH DE number 1215499 (Why is no real title available?)
| 1999-07-05 | Paper |
A constructive game semantics for the language of linear logic
Annals of Pure and Applied Logic | 1998-02-04 | Paper |
A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
Notre Dame Journal of Formal Logic | 1995-07-03 | Paper |
