Complexity in Young's Lattice
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910781265674240 |
|---|---|
| author | Wires, Alexander |
| author_facet | Wires, Alexander |
| contents | We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently, as an ordered set Young's lattice has an undecidable elementary theory and is inherently non-finitely axiomatizable but every ideal generates a finitely axiomatizable universal class of equivalence relations. We end with conjectures concerning the complexities of the $Σ_1$ and $Σ_2$-theories. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1907_13360 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Complexity in Young's Lattice Wires, Alexander Combinatorics Logic 05A05, 05A17, 05A18 We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently, as an ordered set Young's lattice has an undecidable elementary theory and is inherently non-finitely axiomatizable but every ideal generates a finitely axiomatizable universal class of equivalence relations. We end with conjectures concerning the complexities of the $Σ_1$ and $Σ_2$-theories. |
| title | Complexity in Young's Lattice |
| topic | Combinatorics Logic 05A05, 05A17, 05A18 |
| url | https://arxiv.org/abs/1907.13360 |