English
Related papers

Related papers: On First-Order Definable Colorings

200 papers

We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…

Logic · Mathematics 2025-06-16 Pablo Andújar Guerrero

We reformulate Hrushovski's definability patterns from the setting of first order logic to the setting of positive logic. Given an h-universal theory T we put two structures on the type spaces of models of T in two languages, \mathcal{L}…

Logic · Mathematics 2022-07-28 Ori Segel

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

Logic in Computer Science · Computer Science 2023-03-31 Miguel Campercholi , Mauricio Tellechea , Pablo Ventura

We say a structure $M$ in a first-order language is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure $M'$ of $M$ such that $M'$ is isomorphic to $M$. Additionally, we say that $M$ is…

Logic · Mathematics 2019-09-04 Nadav Meir

We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…

Algebraic Topology · Mathematics 2017-11-15 Marcel Bökstedt

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

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 the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

Logic in Computer Science · Computer Science 2022-07-12 Julien Grange

In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…

Rings and Algebras · Mathematics 2022-08-23 RB Yadav , Liangyun Chen , Yao Ma , Ying Hou

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

A notion of Hochschild cohomology of an abelian category was defined by Lowen and Van den Bergh (2005) and they showed the existence of a characteristic morphism from the Hochschild cohomology into the graded centre of the (bounded) derived…

K-Theory and Homology · Mathematics 2014-01-14 Wendy Lowen

We introduce in this paper a hypercohomology version of the resonance varieties and obtain some relations to the characteristic varieties of rank one local systems on a smooth quasi-projective complex variety $M$, see Theorem (3.1) and…

Algebraic Geometry · Mathematics 2019-02-20 Alexandru Dimca

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…

Computational Complexity · Computer Science 2017-03-28 Petr Golovach , Matthew Johnson. Barnaby Martin , Daniel Paulusma , Anthony Stewart

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Logic · Mathematics 2021-01-01 Dakota Thor Ihli

An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…

Mathematical Physics · Physics 2009-11-10 Simonetta Frittelli

In this work we show that the ordering ambiguity on quantization depends on the representation choice. This property is then used to solve unambiguously some particular systems. Finally, we speculate on the consequences for more involved…

Quantum Physics · Physics 2007-05-24 Alvaro de Souza Dutra

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. The dynamics for arities of…

Logic · Mathematics 2021-12-20 Sergey V. Sudoplatov

For a triple of complex hyperplane arrangements, there is a well-known long exact sequence relating the cohomology of the complements. We observe that this result extends to certain local coefficient systems, and use this extension to study…

Algebraic Geometry · Mathematics 2007-05-23 Daniel C. Cohen

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman