| Publication | Date of Publication | Type |
|---|
The existential fragment of second-order propositional intuitionistic logic is undecidable
Journal of Applied Non-Classical Logics | 2024-03-20 | Paper |
Automata theory approach to predicate intuitionistic logic
Journal Of Logic And Computation | 2022-09-08 | Paper |
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note)
Theoretical Computer Science | 2019-10-07 | Paper |
First-order Answer Set Programming as Constructive Proof Search
Theory and Practice of Logic Programming | 2018-12-04 | Paper |
Answer set programming in intuitionistic logic
Indagationes Mathematicae. New Series | 2018-01-12 | Paper |
| Synthesis of functional programs with help of first-order intuitionistic logic | 2017-10-17 | Paper |
Automata theory approach to predicate intuitionistic logic
(available as arXiv preprint) | 2017-10-13 | Paper |
| Automata theoretic account of proof search | 2017-08-31 | Paper |
How hard is positive quantification?
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
| Restricted positive quantification is not elementary | 2017-07-12 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Logical Methods in Computer Science | 2017-04-11 | Paper |
| Decidable structures between Church-style and Curry-style | 2017-02-01 | Paper |
Relational abstract domain of weighted hexagons
Electronic Notes in Theoretical Computer Science | 2016-06-17 | Paper |
The role of polymorphism in the characterisation of complexity by soft types
Information and Computation | 2016-05-03 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Lecture Notes in Computer Science | 2015-10-01 | Paper |
A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments
Information Processing Letters | 2015-06-25 | Paper |
Existential type systems between Church and Curry style (type-free style)
Theoretical Computer Science | 2014-08-27 | Paper |
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
Information and Computation | 2012-11-27 | Paper |
| ML with PTIME complexity guarantees | 2012-11-22 | Paper |
| THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F | 2012-04-25 | Paper |
The role of polymorphism in the characterisation of complexity by soft types
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Existential Type Systems with No Types in Terms
Lecture Notes in Computer Science | 2009-07-07 | Paper |
The Existential Fragment of the One-Step Parallel Rewriting Theory
Rewriting Techniques and Applications | 2009-06-30 | Paper |
On the building of affine retractions
Mathematical Structures in Computer Science | 2008-08-15 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 1759491 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1722667 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1512625 (Why is no real title available?) | 2000-10-03 | Paper |
