Related papers: Order-Invariance of Two-Variable Logic is coNExpTi…
The 1-in-3 and Not-All-Equal satisfiability problems for Boolean CNF formulas are two well-known NP-hard problems. In contrast, the promise 1-in-3 vs. Not-All-Equal problem can be solved in polynomial time. In the present work, we…
We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.
A great number of problems of relativistic position in quantum mechanics are due to the use of coordinates which are not inherent objects of spacetime, cause unnecessary complications and can lead to misconceptions. We apply a…
We study the gauge invariant cosmological perturbations up to second order. We show that there are infinite families of gauge invariant variables at both of the first and second orders. The conversion formulae among different families are…
We obtain a generalization of Noether's invariance principle for optimal control problems with equality and inequality state-input constraints. The result relates the invariance properties of the problems with the existence of conserved…
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment…
We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…
We show that over the class of linear orders with additional binary relations satisfying some monotonicity conditions, monadic first-order logic has the three-variable property. This generalizes (and gives a new proof of) several known…
For relational monadic formulas (the L\"owenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting - operations that currently receive much attention in…
This paper is devoted to study exact controllability of two one-dimensional coupled wave equations with first-order coupling terms with coefficients depending on space and time. We give a necessary and sufficient condition for both exact…
After introducing the concept of commutativity for continuous-time linear time-varying systems, the related literature and the results obtained so far are presented. For a simple introduction of the commutativity of discrete-time linear…
We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…
We consider initial boundary value problems for one-dimensional diffusion equation with time-fractional derivative of order $\alpha \in (0,1)$ which are subject to non-zero Neumann boundary conditions. We prove the uniqueness for an inverse…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded existential rules and (unions of) conjunctive queries, and we investigate the problem of FO-rewritability, i.e., whether an OMQ can be rewritten as a first-order…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem…
The two-component formalism in quantum cosmology is revisited with a particular emphasis on the identification of time. Its relation with the appearance of imaginary eigenvalues is established. It is explicitly shown how a good choice of…
We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…