Metraipolis › archive › dc_716ac29792ed
A Rank-Preserving Gaifman Normal Form for First-Order Logic on Weighted Structures — arXiv:2609.37337
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:37:14.110Z
- SHA-256 of the archived text
898d32839c95c62f201ab3fcbfe4709997bc2e70f5e948ac4b26dcd95b1b703b- Stable URL of this page
https://metraipolis.com/documento/dc_716ac29792ed
How to cite
A Rank-Preserving Gaifman Normal Form for First-Order Logic on Weighted Structures — arXiv:2609.37337 — arXiv (en), https://arxiv.org/abs/2609.37337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_716ac29792ed (Metraipolis archive dc_716ac29792ed, sha256 898d32839c95c62f201ab3fcbfe4709997bc2e70f5e948ac4b26dcd95b1b703b)
BibTeX
@misc{dc716ac29792ed,
title = {A Rank-Preserving Gaifman Normal Form for First-Order Logic on Weighted Structures — arXiv:2609.37337},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_716ac29792ed; sha256 898d32839c95c62f201ab3fcbfe4709997bc2e70f5e948ac4b26dcd95b1b703b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove a rank-preserving version of Gaifman's Theorem. Compared to earlier rank-preserving locality theorems (in particular, [Grohe, Kreutzer, Siebertz, JACM 2017]), our theorem is much simpler and yields formulas in exactly the same normal form as Gaifman's original theorem. Furthermore, it holds not only for first-order logic, but also for first-order logic with modulo-counting quantifiers and, more generally, for the first-order logic on weighted structures ngFOW+ that is introduced in this article. As an application of our theorem, we give a simplified proof of the algorithmic meta-theorem of [Grohe, Kreutzer, Siebertz, JACM 2017] stating that first-order properties of nowhere dense structures can be decided in almost-linear time. Our locality theorem for the weight logic ngFOW+ can be seen as an essential step toward such a meta-theorem for this logic. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.LO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Logic (math.LO). Pagina del lavoro: https://arxiv.org/abs/2609.37337 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T18:03:25.991Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).