English
Related papers

Related papers: When Locality Meets Preservation

200 papers

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

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…

Logic in Computer Science · Computer Science 2017-03-06 Dietrich Kuske , Nicole Schweikardt

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik

In a very general quasilinear setting, we show that the regularizing effect of a first order term causes the existence of energy solutions for problems involving the Hardy potential and $L^1$ data. In the same setting we study sharp (local…

Analysis of PDEs · Mathematics 2022-05-13 G. Chirillo , L. Montoro , L. Muglia , B. Sciunzi

Generalizing results by Bryant and Griffiths [Duke Math. J., 1995, V.78, 531-676], we completely describe local conservation laws of second-order (1+1)-dimensional evolution equations up to contact equivalence. The possible dimensions of…

Analysis of PDEs · Mathematics 2008-08-06 Roman O. Popovych , Anatoly M. Samoilenko

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it is not always possible to 'choose a fresh variable…

Logic in Computer Science · Computer Science 2023-12-27 Gilles Dowek , Murdoch J. Gabbay , Dominic Mulligan

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

Computational Complexity · Computer Science 2007-06-26 Nerio Borges , Blai Bonet

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot

Two extension problems are solved. First, the class of locally matricial algebras over an arbitrary field is closed under extensions. Second, the class of locally finite dimensional semisimple algebras over a fixed field is closed under…

Rings and Algebras · Mathematics 2025-04-18 K. R. Goodearl

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…

Logic in Computer Science · Computer Science 2014-05-01 Carsten Fuhs , Cynthia Kop

We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…

Combinatorics · Mathematics 2019-11-28 Václav Košík , Štěpán Starosta

We prove a number of results on the survival of the type-I property under extensions of locally compact groups: (a) that given a closed normal embedding $\mathbb{N}\trianglelefteq\mathbb{E}$ of locally compact groups and a twisted action…

Operator Algebras · Mathematics 2022-06-14 Alexandru Chirvasitu

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…

Artificial Intelligence · Computer Science 2009-02-24 Claus-Peter Wirth

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…

Combinatorics · Mathematics 2019-09-13 Anton Bernshteyn

A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…

Logic · Mathematics 2026-01-14 James Carr

In this article, after recalling and discussing the conventional extremality, local extremality, stationarity and approximate stationarity properties of collections of sets and the corresponding (extended) extremal principle, we focus on…

Optimization and Control · Mathematics 2018-05-15 Hoa T. Bui , Alexander Y. Kruger

This paper aims to provide various applications for second-order variational analysis of extended-real-valued piecewise liner functions recently obtained in [1]. We mainly focus here on establishing relationships between full stability of…

Optimization and Control · Mathematics 2016-08-23 B. S. Mordukhovich , M. E. Sarabi

This is a continuation of the paper [FJS] with a similar title. Several results from there are strengthened, in particular: 1. If T is a "natural" embedding of l_2^n into L_1 then, for any well-bounded factorization of T through an L_1…

Functional Analysis · Mathematics 2009-09-25 Tadek Figiel , William B. Johnson , Gideon Schechtman
‹ Prev 1 8 9 10 Next ›