Related papers: Continuous first order logic and local stability

Temporal logics are a powerful tool to specify properties of computational systems. For concurrent programs, Higher Dimensional Automata (HDA) are a very expressive model of non-interleaving concurrency. HDA recognize languages of partially…

In this paper, we consider a non-linear fourth-order evolution equation of Cahn-Hilliard-type on evolving surfaces with prescribed velocity, where the non-linear terms are only assumed to have locally Lipschitz derivatives. High-order…

In this paper we study the long-time stability of the Cauchy one-leg theta-methods for the two-dimensional NavierStokes equations. We establish the uniform dissipativity in H^1, in the sense that the semi-discrete-in-time approximations…

This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…

This paper examines how a notion of stable explanation developed elsewhere in Defeasible Logic can be expressed in the context of formal argumentation. With this done, we discuss the deontic meaning of this reconstruction and show how to…

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

We develop causality theory for upper semi-continuous distributions of cones over manifolds generalizing results from mathematical relativity in two directions: non-round cones and non-regular differentiability assumptions. We prove the…

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

In this paper, we study the probabilistic local well-posedness of the cubic Schr\"odinger equation (cubic NLS): \[ (i\partial_{t} + \Delta) u = \pm |u|^{2} u \text{ on } [0,T) \times \mathbb{R}^{d}, \] with initial data being a Wiener…

We consider the cubic nonlinear Schr\"odinger equation (NLS) on $\mathbb{R}^3$ with randomized initial data. In particular, we study an iterative approach based on a partial power series expansion in terms of the random initial data. By…

In this article we study linear temporal logics with team semantics (TeamLTL) that are novel logics for defining hyperproperties. We define Kamp-type translations of these logics into fragments of first-order team logic and second-order…

We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous…

The Cauchy problem for first order system $L(t, x, \D_t, \D_x)$ is known to be well posed in $L^2$ when a it admits a microlocal symmetrizer $S(t,x, \xi)$ which is smooth in $\xi$ and Lipschitz continuous in $(t, x)$. This paper contains…

We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…

In this paper, we prove a stability result for the non-K\"ahler geometry of locally conformally K\"ahler (lcK) spaces with singularities. Specifically, we find sufficient conditions under which the image of an lcK space by a holomorphic…

Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc. In recent years, different linear-time logics for specifying…

We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive…

One way to interpret the reasoning power of transformer-based language models is to describe the types of logical rules they can resolve over some input text. Recently, Chiang et al. (2023) showed that finite-precision transformers can be…

Following the lines of the analysis done in [BPZ07, BCF07] for first-order G\"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order…