Cover Image

Local and global $d$-rigidity are not definable in the first order logic of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bernstein, Daniel Irving, Vaduthala, Nathaniel
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Representability of Flag Matroids
by: Bernstein, Daniel Irving, et al.
Published: (2025)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

Homomorphisms of Partial Fields
by: Vaduthala, Nathaniel
Published: (2025)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

A logical limit law for the sequential model of preferential attachment graphs
by: Özdemir, Alperen
Published: (2024)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

A logical approach to concentration
by: Benedikt, Michael, et al.
Published: (2026)

Borel line graphs
by: Anderson, James, et al.
Published: (2023)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

The ineffectiveness of the regularity lemma for bounded degree graphs
by: Lyons, Clark, et al.
Published: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Higher-order generalizations of stability and arithmetic regularity
by: Terry, C., et al.
Published: (2021)

Reductions of well-ordering principles to combinatorial theorems
by: Carlucci, Lorenzo, et al.
Published: (2024)

Borel fractional perfect matchings in quasi-transitive amenable graphs
by: Murray, Sam
Published: (2025)

On the expressive power of inquisitive team logic and inquisitive first-order logic
by: Kontinen, Juha, et al.
Published: (2026)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
by: Fu, Yayi
Published: (2023)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

On semantics of first-order justification logic with binding modalities
by: Yavorskaya, Tatiana, et al.
Published: (2025)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

Modal definability in Euclidean modal logics
by: Balbiani, Philippe, et al.
Published: (2025)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

One-variable fragments of first-order logics
by: Cintula, Petr, et al.
Published: (2023)

Stabilizers, Measures and IP-sets
by: Martin-Pizarro, Amador, et al.
Published: (2019)

On n-dependence
by: Chernikov, Artem, et al.
Published: (2014)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

Geometric duality, perfect graphs, and the Sierpiński space
by: Borodulin-Nadzieja, Piotr, et al.
Published: (2026)

Borel Local Lemma: arbitrary random variables and limited exponential growth
by: Bernshteyn, Anton, et al.
Published: (2024)

Order-invariant cluster first-order logic on graph classes of bounded degree
by: Ghasemi, Fatemeh, et al.
Published: (2026)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
by: Bernshteyn, Anton, et al.
Published: (2023)

Embedding Borel graphs into grids of asymptotically optimal dimension
by: Bernshteyn, Anton, et al.
Published: (2024)

Large-scale geometry of Borel graphs of polynomial growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Making first order linear logic a generating grammar
by: Slavnov, Sergey
Published: (2022)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
by: Oda, Yukihiro, et al.
Published: (2021)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

Forcing and Interpolation in first-order hybrid Logic with rigid symbols
by: Găină, Daniel, et al.
Published: (2026)