Related papers: An Optimal Construction for the Barthelmann-Schwen…

We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes two already well-known ones -- the Bernays-Sch\"onfinkel-Ramsey (BSR) Fragment and the Monadic Fragment. The defining principle is the…

In the first part, after showing that the most natural approach to define an order on sets of conformal classes fails, we define a nontrivial order $\leq_2$ on the set of conformal classes of compact Cauchy slabs with fixed past boundary…

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain $\vee$ within the scope of quantifiers. The disjuncts of these FOLDNFs are…

Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…

We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a…

We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed…

We study problems connected to first-order logic in graphs of bounded twin-width. Inspired by the approach of Bonnet et al. [FOCS 2020], we introduce a robust methodology of local types and describe their behavior in contraction sequences…

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

A central computational task in database theory, finite model theory, and computer science at large is the evaluation of a first-order sentence on a finite structure. In the context of this task, the \emph{width} of a sentence, defined as…

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 consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it…

This article is devoted to the construction of new numerical methods for the semiclassical Schr\"odinger equation. A phase-amplitude reformulation of the equation is described where the Planck constant epsilon is not a singular parameter.…

Consider two kinds of 1-d Hamiltonian Derivative Nonlinear Schr\"odinger (DNLS) equations with respect to different symplectic forms under periodic boundary conditions. The nonlinearities of these equations depend not only on…

We study well-posedness of boundary value problems of Dirichlet and Neumann type for elliptic systems on the upper half-space with coefficients independent of the transversal variable, and with boundary data in fractional…

A degenerate fourth-order parabolic equation modeling condensation phenomena related to Bose-Einstein particles is analyzed. The model is a Fokker-Planck-type approximation of the Boltzmann-Nordheim equation, only keeping the leading order…

We apply the BFFT formalism to a prototypical second-class system, aiming to convert its constraints from second- to first-class. The proposed system admits a consistent initial set of second-class constraints and an open potential function…

The minimization of propositional formulae is a classical problem in logic, whose first algorithms date back at least to the 1950s with the works of Quine and Karnaugh. Most previous work in the area has focused on obtaining minimal, or…

We consider the 1D cubic NLS on $\mathbb R$ and prove a blow-up result for functions that are of borderline regularity, i.e. $H^s$ for any $s<-\frac 12$ for the Sobolev scale and $\mathcal F L^\infty$ for the Fourier-Lebesgue scale. This is…

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…