Related papers: One-dimensional guarded fragments
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
We show that H\"older continuity of the gradient is not only a sufficient condition, but also a necessary condition for the existence of a global upper bound on the error of the first-order Taylor approximation. We also relate this global…
Verification of properties of first order logic with two variables FO2 has been investigated in a number of contexts. Over arbitrary structures it is known to be decidable with NEXPTIME complexity, with finitely satisfiable formulas having…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…
We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…
Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…
We discuss a variety of codimension-one, non-invertible topological defects in general 3+1d QFTs with a discrete one-form global symmetry. These include condensation defects from higher gauging of the one-form symmetries on a…
We classify the allowed structures of the discrete 1-form gauge sector in six-dimensional supergravity theories realized as F-theory compactifications. This provides upper bounds on the 1-form gauge factors $\mathbb{Z}_m$ and in particular…
This paper introduces and formally verifies a novel geometric framework for first-order stochastic dominance (FSD) in $N$ dimensions using the Lean 4 theorem prover. Traditional analytical approaches to multi-dimensional stochastic…
The elimination distance to some target graph property P is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We…
Linearized supergravity in arbitrary dimension is reformulated into a first order formalism which treats the graviton and its dual on the same footing at the level of the action. This generalizes previous work by other authors in two…
Order-invariant first-order logic is an extension of first-order logic FO where formulae can make use of a linear order on the structures, under the proviso that they are order-invariant, i.e. that their truth value is the same for all…
The integration of first-principles models with learning-based components, i.e., model augmentation, has gained increasing attention, as it offers higher model accuracy and faster convergence properties compared to black-box approaches,…
We develop a first order formalism for constructing gravitational duals of conformal defects in a bottom up approach. Similarly as for the flat domain walls a single function specifies the solution completely. Using this formalism we…
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…
A shape optimization problem arising from the optimal reinforcement of a membrane by means of one-dimensional stiffeners or from the fastest cooling of a two-dimensional object by means of ``conducting wires'' is considered. The criterion…
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…