Related papers: Order-Invariance of Two-Variable Logic is coNExpTi…
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…
Two alternative interpretations of the quantum collapse are proposed: a time-ordered and a timeless one. The time-ordered interpretation implies that the speed of light can be defined in an absolute way, while the timeless quantum collapse…
The optimal time for the controllability of linear hyperbolic systems in one dimensional space with one-side controls has been obtained recently for time-independent coefficients in our previous works. In this paper, we consider linear…
The causal structure of Einstein's evolution equations is considered. We show that in general they can be written as a first order system of balance laws for any choice of slicing or shift. We also show how certain terms in the evolution…
We study, using an optimal control point of view, higher-order variational problems of Herglotz type with time delay. Main results are higher-order Euler-Lagrange and DuBois-Reymond necessary optimality conditions as well as a higher-order…
In this paper we give refinements of some convex and log-convex moment inequalities of the first and second order using a special kind of positive semi-definite form. An open problem concerning eight parameter refinement of second order is…
We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall,…
We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…
We clarify the complexity of answering unions of conjunctive queries over knowledge bases formulated in the description logic $\mathcal S$, the extension of $\mathcal{ALC}$ with transitive roles. Contrary to what existing partial results…
Motivated by the work of P.L. Lions and J-C. Rochet [12], concerning multi-time Hamilton-Jacobi equations, we introduce the theory of multi-time systems of conservation laws. We show the existence and uniqueness of solution to the Cauchy…
We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified in 1968 by W.V. Quine. We show that the satisfiability problem for this fragment has non-elementary…
We study the large time behavior of solutions of first-order convex Hamilton-Jacobi Equations of Eikonal type set in the whole space. We assume that the solutions may have arbitrary growth. A complete study of the structure of solutions of…
We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and polylogarithmic space (PolylogSpace). We introduce a novel two-sorted logic that separates the elements of the input domain…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
This paper is concerned with the derivation of first- and second-order sufficient optimality conditions for optimistic bilevel optimization problems involving smooth functions. First-order sufficient optimality conditions are obtained by…
We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.
An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for $\SI 1$, the…
We start the study of the enumeration complexity of different satisfiability problems in first-order team logics. Since many of our problems go beyond DelP, we use a framework for hard enumeration analogous to the polynomial hierarchy,…
This paper is devoted to establishing an enhanced Fritz John type first-order necessary condition for a general constrained nonlinear infinite-dimensional optimization problem. Unlike traditional constraint qualifications in optimization…