# Complexity in Young's Lattice

@article{Wires2019ComplexityIY, title={Complexity in Young's Lattice}, author={A. Wires}, journal={arXiv: Combinatorics}, year={2019} }

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… Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

Defining Recursive Predicates in Graph Orders

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2018

Definability in Substructure Orderings, II: Finite Ordered Sets

- Mathematics, Computer Science
- Order
- 2010

Theories of orders on the set of words

- Mathematics, Computer Science
- RAIRO Theor. Informatics Appl.
- 2006