English
Related papers

Related papers: Preservation under Substructures modulo Bounded Co…

200 papers

We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…

Logic · Mathematics 2022-02-23 Ehud Hrushovski

We revisit the work studying homomorphism preservation for first-order logic in sparse classes of structures initiated in [Atserias et al., JACM 2006] and [Dawar, JCSS 2010]. These established that first-order logic has the homomorphism…

Logic in Computer Science · Computer Science 2024-05-21 Anuj Dawar , Ioannis Eleftheriadis

Let $\rho$ f,$\lambda$ be the residual Galois representation attached to a newform f and a prime ideal $\lambda$ in the integer ring of its coefficient field. In this paper, we prove explicit bounds for the residue characteristic of the…

Number Theory · Mathematics 2020-11-23 Baptiste Peaucelle

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

Logic in Computer Science · Computer Science 2023-06-22 Davide Rinaldi , Daniel Wessel

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…

Formal Languages and Automata Theory · Computer Science 2014-07-02 Manfred Kufleitner , Tobias Walter

We introduce a restricted second-order logic $\mathrm{SO}^{\mathit{plog}}$ for finite structures where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. We demonstrate the…

Logic in Computer Science · Computer Science 2019-12-03 Flavio Ferrarotti , Senen Gonzáles , Klaus-Dieter Schewe , José María Turull-Torres

We investigate the question of how the knowledge of sufficiently many local conservation laws for a model can be utilized to solve the model. We show that for models where the conservation laws can be written in one-sided forms, like…

High Energy Physics - Theory · Physics 2016-08-15 Erling G. B. Hohler , Kåre Olaussen

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a FO-definable language that is monotone in monadic predicates but not definable in FO+. This provides…

Formal Languages and Automata Theory · Computer Science 2021-10-12 Denis Kuperberg

By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…

Logic in Computer Science · Computer Science 2023-10-03 Max Bannach , Florian Chudigiewitsch , Till Tantau

Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2)…

Logic in Computer Science · Computer Science 2015-06-30 Facundo Carreiro

We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ and over $RCA_0 + B\Sigma^0_n$ for all $n \geq 2$ by recursion-theoretic means. We first characterize COH over $RCA_0 + B\Sigma^0_2$ as a…

Logic · Mathematics 2022-12-27 David R. Belanger

Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…

Group Theory · Mathematics 2026-02-27 Pedro Lourenço

We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…

Logic · Mathematics 2026-04-24 Jonathan Osinski , Trevor Wilson

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

Logic · Mathematics 2026-05-05 Radek Honzik

We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for…

Logic in Computer Science · Computer Science 2016-03-31 Kord Eickmeyer , Michael Elberfeld , Frederik Harwath

We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO$^2$, its extension C$^2$ with counting quantifiers, and the guarded fragment GF. We prove that if…

Artificial Intelligence · Computer Science 2024-08-23 Carsten Lutz , Quentin Manière

Using techniques from TRO equivalence of masa bimodules we prove various transference results: We show that when $\alpha$ is a group homomorphism which pushes forward the Haar measure of $G$ to a measure absolutely continuous with respect…

Functional Analysis · Mathematics 2022-06-27 M. Anoussis , G. K. Eleftherakis , A. Katavolos

We prove the existence of Verdier stratifications for sets definable in any o-minimal structure on (R, +, .). It is also shown that the Verdier condition (w) implies the Whitney condition (b) in o-minimal structures on (R, +, .). As a…

Differential Geometry · Mathematics 2009-09-25 Ta Lê Loi

We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…

Logic · Mathematics 2022-08-23 Vera Fischer , Corey Bacal Switzer

Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by this theorem is a tower of exponentials whose height…

Data Structures and Algorithms · Computer Science 2026-05-04 Michael Lampis