相关论文: Local tabularity in MS4 with Casari's axiom

We provide a characterization of infinite algebraic Galois extensions of the rationals with uniformly bounded local degrees, giving a detailed proof of all the results announced in a paper by Checcoli and Zannier and obtaining relevant…

In this paper we provide a notion of causality for the violation of general Linear Temporal Logic (LTL) properties. The current work is a natural extension of the previously proposed approach handling causality in the context of…

Local search has recently been applied to SMT problems over various arithmetic theories. Among these, nonlinear real arithmetic poses special challenges due to its uncountable solution space and potential need to solve higher-degree…

In this paper we penetrate and extend the notion of local constancy in graphical models that has been introduced by Honorio et al. (2009). We propose Neighborhood-Fused Lasso, a method for model selection in high-dimensional graphical…

Generalising the chiral boundary conditions of $\mathbb{R}^{1,3}$ gravity for AdS$_4$ gravity, we derive chiral locally AdS$_4$ solutions in the Newman-Unti gauge consistent with a variational principle whose asymptotic symmetry algebra we…

We study the local H\"{o}lder regularity of weak solutions to the fully fractional parabolic equations involving spatial fractional diffusion and fractional time derivatives of the Marchaud type. It is worth noting that we do not impose…

Interprocedural analysis by means of partial tabulation of summary functions may not terminate when the same procedure is analyzed for infinitely many abstract calling contexts or when the abstract domain has infinite strictly ascending…

We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardinalities of sets. Adding cardinality atoms to the language of…

We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo. This…

Given two parties performing experiments in separate laboratories, we provide a diagrammatic formulation of what it means for the joint statistics of their experiments to satisfy local realism. In particular, we show that the principles of…

The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…

Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a formula with respect to certain background first order theories. In this paper, we focus on Satisfiablity Modulo Integer Arithmetic, which is…

We study 4d $\mathcal{N}=1$ supersymmetric theories on a compact Euclidean manifold of the form $S^1 \times\mathcal{M}_3$. Partition functions of gauge theories on this background can be computed using localization, and explicit formulas…

This note begins the model-theoretic study of local real closed SV-rings of finite rank; to this end, a structure theorem for reduced local SV-rings of finite rank is given and branching ideals in local real closed rings of finite rank are…

This paper presents a framework for local solutions to time-varying linear differential-algebraic equations (DAEs) with real meromorphic coefficients. The local solutions on compact intervals form a sheaf. This permits a simple definition…

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…

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 prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and…

Different extended objects can fall in different ways, depending on their internal structures. Some motions are nevertheless impossible, regardless of internal structure. This paper derives universal constraints on extended-body motion,…

In this article, we develop and investigate a new classifier based on features extracted using spatial depth. Our construction is based on fitting a generalized additive model to the posterior probabilities of the different competing…