| Publication | Date of Publication | Type |
|---|
| A propositional cirquent calculus for computability logic. | 2025-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5883184 | 2023-03-29 | Paper |
| Cirquent Calculus in a Nutshell | 2023-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5869526 | 2022-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5869722 | 2022-09-28 | Paper |
| Elementary-base cirquent calculus II: Choice quantifiers | 2021-12-03 | Paper |
| Cirquent calculus in a nutshell | 2021-08-27 | Paper |
| Computability logic: Giving Caesar what belongs to Caesar | 2020-09-17 | Paper |
| Arithmetics based on computability logic | 2020-03-06 | Paper |
| Elementary-base cirquent calculus I: Parallel and choice connectives | 2017-07-16 | Paper |
| Propositional computability logic I | 2017-07-12 | Paper |
| Propositional computability logic II | 2017-07-12 | Paper |
| Build your own clarithmetic I: Setup and completeness | 2017-04-11 | Paper |
| Build your own clarithmetic II: Soundness | 2017-04-11 | Paper |
| Introduction to clarithmetic. II | 2016-03-10 | Paper |
| On the system CL12 of computability logic | 2015-08-25 | Paper |
| Introduction to clarithmetic. III | 2014-01-13 | Paper |
| Computability Logic: A Formal Theory of Interaction | 2013-06-18 | Paper |
| The taming of recurrences in computability logic through cirquent calculus. II | 2013-02-15 | Paper |
| The taming of recurrences in computability logic through cirquent calculus. I | 2013-02-15 | Paper |
| A new face of the branching recurrence of computability logic | 2012-10-17 | Paper |
| A logical basis for constructive systems | 2012-06-20 | Paper |
| Separating the basic logics of the basic recurrences | 2012-04-13 | Paper |
| Introduction to clarithmetic. I | 2011-10-27 | Paper |
| From formulas to cirquents in computability logic | 2011-05-26 | Paper |
| Toggling operators in computability logic | 2011-03-14 | Paper |
| Towards applied theories based on computability logic | 2010-06-24 | Paper |
| In the beginning was game semantics | 2009-04-14 | Paper |
| Many concepts and two logics of algorithmic reduction | 2009-03-17 | Paper |
| Sequential operators in computability logic | 2009-02-03 | Paper |
| Cirquent Calculus Deepened | 2008-12-22 | Paper |
| Intuitionistic computability logic | 2007-10-26 | Paper |
| The intuitionistic fragment of computability logic at the propositional level | 2007-07-16 | Paper |
| From truth to computability. II. | 2007-07-16 | Paper |
| The logic of interactive turing reduction | 2007-03-12 | Paper |
| Introduction to Cirquent Calculus and Abstract Resource Semantics | 2006-12-04 | Paper |
| From truth to computability. I. | 2006-08-16 | Paper |
| Introduction to computability logic | 2003-09-25 | Paper |
| The propositional logic of elementary tasks | 2003-07-31 | Paper |
| The logic of tasks | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330857 | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215636 | 1999-07-05 | Paper |
| A constructive game semantics for the language of linear logic | 1998-02-04 | Paper |
| A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic | 1995-07-03 | Paper |
