| Publication | Date of Publication | Type |
|---|
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Journal Of Logic And Computation | 2024-02-08 | Paper |
Extensions of Solovay's system \(\mathbf{S}\) without independent sets of axioms
Annals of Pure and Applied Logic | 2023-10-12 | Paper |
Complexity of the universal theory of residuated ordered groupoids
Journal of Logic, Language and Information | 2023-08-14 | Paper |
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
Logical Investigations | 2023-01-16 | Paper |
On independent axiomatizability of quasi-normal modal logics
Studia Logica | 2022-10-04 | Paper |
Complexity of finite-variable fragments of products with non-transitive modal logics
Journal Of Logic And Computation | 2022-09-22 | Paper |
scientific article; zbMATH DE number 7585731 (Why is no real title available?)
| 2022-09-15 | Paper |
Complexity and expressivity of propositional dynamic logics with finitely many variables
Logic Journal of the IGPL | 2022-08-10 | Paper |
Undecidability of the Logic of Partial Quasiary Predicates
Logic Journal of the IGPL | 2022-07-22 | Paper |
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
Theoretical Computer Science | 2022-06-24 | Paper |
Correction to: ``Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
Studia Logica | 2022-03-23 | Paper |
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
Journal Of Logic And Computation | 2021-09-22 | Paper |
Computational complexity for bounded distributive lattices with negation
Annals of Pure and Applied Logic | 2021-06-14 | Paper |
Complexity of finite-variable fragments of products with K
Journal Of Logic And Computation | 2021-04-09 | Paper |
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
Journal Of Logic And Computation | 2021-04-09 | Paper |
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
Journal Of Logic And Computation | 2020-12-15 | Paper |
Recursive enumerability and elementary frame definability in predicate modal logic
Journal Of Logic And Computation | 2020-06-04 | Paper |
Complexity of the universal theory of modal algebras
Studia Logica | 2020-03-27 | Paper |
Complexity of finite-variable fragments of propositional modal logics of symmetric frames
Logic Journal of the IGPL | 2019-11-04 | Paper |
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
| 2019-10-12 | Paper |
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
Studia Logica | 2019-09-03 | Paper |
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
Algebra Universalis | 2019-08-09 | Paper |
A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames
| 2019-07-24 | Paper |
Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
| 2018-11-23 | Paper |
Modal logics for reasoning about infinite unions and intersections of binary relations
Journal of Applied Non-Classical Logics | 2018-08-28 | Paper |
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
| 2017-06-15 | Paper |
Tableau-based decision procedures for logics of strategic ability in multiagent systems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge
Logic Journal of the IGPL | 2013-06-11 | Paper |
Synthesizing strategies for homogeneous multi-agent systems with incomplete information
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Finding Uniform Strategies for Multi-agent Systems
Lecture Notes in Computer Science | 2010-08-24 | Paper |
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
Logical Foundations of Computer Science | 2009-02-24 | Paper |
scientific article; zbMATH DE number 5295701 (Why is no real title available?)
| 2008-07-01 | Paper |
A general method for proving decidability of intuitionistic modal logics
Journal of Applied Logic | 2006-10-10 | Paper |
