Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2401.08082 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929234001264640 |
|---|---|
| author | Fischer, Eldar |
| author_facet | Fischer, Eldar |
| contents | We investigate models of relations over a bounded continuous segment of real numbers, along with the natural linear order over the reals being provided as a "hard-coded" relation. This paper presents a generalization of a lemma from [Ben-Eliezer, Fischer, Levi and Yoshida, ITCS 2021], showing that with a small amount of modification (measured in terms of the Lebesgue measure) we can replace such a model with a "pixelated" one that has a finite description, in a way that preserves all universally quantified statements over the relations, or in other words, without adding any new substructures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_08082 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pixelating Relations and Functions Without Adding Substructures Fischer, Eldar Logic Combinatorics We investigate models of relations over a bounded continuous segment of real numbers, along with the natural linear order over the reals being provided as a "hard-coded" relation. This paper presents a generalization of a lemma from [Ben-Eliezer, Fischer, Levi and Yoshida, ITCS 2021], showing that with a small amount of modification (measured in terms of the Lebesgue measure) we can replace such a model with a "pixelated" one that has a finite description, in a way that preserves all universally quantified statements over the relations, or in other words, without adding any new substructures. |
| title | Pixelating Relations and Functions Without Adding Substructures |
| topic | Logic Combinatorics |
| url | https://arxiv.org/abs/2401.08082 |