Related papers: One-dimensional guarded fragments
Suppose F is a finite set of selfadjoint elements in a tracial von Neumann algebra M. For $\alpha >0$, F is $\alpha$-bounded if the free packing $\alpha$-entropy of F is bounded from above. We say that M is strongly 1-bounded if M has a…
In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local…
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
We investigate the presence of twinlike models in theories described by several real scalar fields. We focus on the first-order formalism, and we show how to build distinct scalar field theories that support the same extended solution, with…
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
The dual-frame formalism leads to an approach to extend numerical relativity simulations in generalized harmonic gauge (GHG) all the way to null infinity. A major setback is that without care, even simple choices of initial data give rise…
The first class constraints in N = 1 supergravity in 2 + 1 dimensions are used to construct a generator of three gauge symmetries (including a local supersymmetry) that leave the action invariant. The algebra of these symmetries closes.…
For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…
The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. The boundary between fragments for which WFOMC can be computed in polynomial time…
First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number…
We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…
Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…
It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…
We extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust…
We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types)…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
We analyze a bi-gravity model based on the first order formalism, having as fundamental variables two tetrads but only one Lorentz connection. We show that on a large class of backgrounds its linearization agrees with general relativity. At…
Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on sequences of valuations of variables over an infinite domain. The atomic formulas are interpreted as constraints on the valuations. The atomic…