Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2311.05996 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911983363686400 |
|---|---|
| author | Meir, Nadav Papadopoulos, Aris Touchard, Pierre |
| author_facet | Meir, Nadav Papadopoulos, Aris Touchard, Pierre |
| contents | Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a reduct of an ultrahomogenous $\aleph_0$-categorical structure which has higher arity than the original structure cannot be Ramsey. In particular, the only nontrivial Ramsey reduct of the generically ordered random $k$-hypergraph is the linear order. We then turn our attention to model-theoretic dividing lines that are characterised by collapsing generalised indiscernibles, and prove, for these dividing lines, several transfer principles in (full and lexicographic) products of structures. As an application, we construct new algorithmically tame classes of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_05996 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Generalised Indiscernibles, Dividing Lines, and Products of Structures Meir, Nadav Papadopoulos, Aris Touchard, Pierre Logic Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a reduct of an ultrahomogenous $\aleph_0$-categorical structure which has higher arity than the original structure cannot be Ramsey. In particular, the only nontrivial Ramsey reduct of the generically ordered random $k$-hypergraph is the linear order. We then turn our attention to model-theoretic dividing lines that are characterised by collapsing generalised indiscernibles, and prove, for these dividing lines, several transfer principles in (full and lexicographic) products of structures. As an application, we construct new algorithmically tame classes of graphs. |
| title | Generalised Indiscernibles, Dividing Lines, and Products of Structures |
| topic | Logic |
| url | https://arxiv.org/abs/2311.05996 |