Local and global d-rigidity are not definable in the first order logic of graphs
Abstract
We use Hanf locality and a result of Cruickshank, Jackson, and Tanigawa on the global rigidity of graphs of k-circuits to prove that local and global d-rigidity are not definable in the first order logic of graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.