Related papers: On the complexity of the Leibniz hierarchy
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the…
A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…
We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…
We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazi\'c and Schmitz (2015), we show that the deducibility problem for full Lambek…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
The polylogarithmic time hierarchy structures sub-linear time complexity. In recent work it was shown that all classes $\tilde{\Sigma}_{m}^{\mathit{plog}}$ or $\tilde{\Pi}_{m}^{\mathit{plog}}$ ($m \in \mathbb{N}$) in this hierarchy can be…
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae.…
We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that…
We put forward an exponential-time algorithm for deciding branching bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of branching (or weak) bisimilarity on normed BPA was once a long standing open problem which…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…
We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the…
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…
It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. Actually, the observations show there are two resources to get classification of filiform Leibniz algebras. The first of them…